Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking

DOI10.1016/j.tcs.2016.01.002zbMath1335.68307OpenAlexW2236520910MaRDI QIDQ2634668

Haibin Zhu, Shaohua Teng, Luyao Teng, Dongning Liu, Yu Zhu, Siqin Zhang

Publication date: 18 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.002

zbMATH Keywords

assignment problemHungarian methodKuhn-Munkres algorithmmany to many assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Related Items (1)

Dual-channel hybrid community detection in attributed networks

Cites Work

• A new polynomial-time algorithm for linear programming
• Incremental assignment problem
• Graph matching using the interference of continuous-time quantum walks
• Parallel synchronous and asynchronous implementations of the auction algorithm
• The \(k\)-cardinality assignment problem
• Task decomposition, dynamic role assignment, and low-bandwidth communication for real-time strategic teamwork
• Algorithms for the Assignment and Transportation Problems
• On Kuhn's Hungarian Method?A tribute from Hungary
• An extension of the Munkres algorithm for the assignment problem to rectangular matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking