Multiple Hungarian Method for <i>k</i>-Assignment Problem

Multiple Hungarian Method for <i>k</i>-Assignment Problem

The <i>k</i>-assignment problem (or, the <i>k</i>-matching problem) on <i>k</i>-partite graphs is an NP-hard problem for <inline-formula><math display="inline"><semantics><mrow><mi>k</mi><mo>≥</mo><mn>...

Full description

Bibliographic Details
Main Authors: Boštjan Gabrovšek, Tina Novak, Janez Povh, Darja Rupnik Poklukar, Janez Žerovnik
Format: Article
Language:English
Published: MDPI AG 2020-11-01
Series:Mathematics
Subjects:
k-assignment problem
k-matching problem
heuristic algorithm
local search
greedy algorithm
hungarian method
Online Access:https://www.mdpi.com/2227-7390/8/11/2050

Similar Items

Similar Items