Matchpair function to solve linear assignment problem
7 views (last 30 days)
Show older comments
Danish Nasir
on 16 Aug 2021
Commented: Danish Nasir
on 16 Aug 2021
1. I want to know whether Hungarian algorithm is an exact solution algorithm or a heuristic?
2. MATLAB has inbuilt fucntion Matchpair to solve linear assignment problem. What is the difference between Hungarian and Matchpair ( in terms of Time complexity, approach,exact or heuristic)?
2 Comments
Steven Lord
on 16 Aug 2021
For more information about the algorithm matchpairs implements, see the reference listed in the References section on the documentation page for the matchpairs function.
Accepted Answer
Walter Roberson
on 16 Aug 2021
The Hungarian Algorithm is an exact solution for linear assignment problems.
I do not know anything about the algorithm used by matchpair() but I do notice that it handles the possibility of rows without matches (such as idle workers), which the Hungarian Algorithm by itself does not handle.
0 Comments
More Answers (0)
See Also
Categories
Find more on Sparse Matrices in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!