Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475435 | Computers & Operations Research | 2008 | 13 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen,