An algorithm for ranking assignments using reoptimization

We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Its computational performance is compared with all available implementations of algorithms with the same time complexity. The results are encouraging.

• Type: Journal
• Year: 2008
• Where: COR
• Authors: Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
• Keywords: COR 2008, Linear Assignment Problem, Possible Assignments, Ranking Assignments