An algorithm for ranking assignments using reoptimization

Authors:
Christian Roed Pedersen;Lars Relund Nielsen;Kim Allan Andersen
Affiliations:
Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, DK-8000 Aarhus C, Denmark;Research Unit of Statistics and Decision Analysis, Department of Genetics and Biotechnology, University of Aarhus, P.O. Box 50, DK-8830 Tjele, Denmark;Department of Business Studies, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 4

Data structures and network algorithms

Data structures and network algorithms
A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Algorithms and codes for dense assignment problems: the state of the art

Discrete Applied Mathematics

Erratum: Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]

Computers and Operations Research
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

Discrete Optimization
Shortlisting top-K assignments

Proceedings of the 25th International Conference on Scientific and Statistical Database Management
A negative dual rectangle cancellation algorithm for the linear assignment problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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.