Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking
Authors:
- Haibin ZhuHZHaibin Zhu
- Dongning LiuDLDongning Liu
- Siqin ZhangSZSiqin Zhang
- Yu ZhuYZYu Zhu
- Luyao TengLTLuyao Teng
- Shaohua TengSTShaohua Teng
Top Cited Papers
- 1 March 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 618, 30-41
Abstract
No abstract availableFunding Information
- NSERC (RGPIN262075-2013)
- National Natural Science Foundation of China (61402118, 61370229)
This publication has 17 references indexed in Scilit:
- Assignment Problems2012
- Group Role Assignment via a Kuhn–Munkres Algorithm-Based SolutionIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2011
- M–M Role-Transfer Problems and Their SolutionsIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2008
- Incremental assignment problemInformation Sciences, 2007
- On Kuhn's Hungarian Method—A tribute from HungaryNaval Research Logistics (NRL), 2004
- The k-cardinality assignment problemDiscrete Applied Mathematics, 1997
- Algorithm for ranked assignments with applications to multiobject trackingJournal of Guidance, Control, and Dynamics, 1989
- An extension of the Munkres algorithm for the assignment problem to rectangular matricesCommunications of the ACM, 1971
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955