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.

[1]  M. Queyranne,et al.  K best solutions to combinatorial optimization problems , 1985 .

[2]  David Lindley,et al.  CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS , 2010 .

[3]  Lars Relund Nielsen,et al.  On the Bicriterion Multi Modal Assignment Problem , 2005 .

[4]  Lars Relund Nielsen,et al.  Route Choice in Stochastic Time-Dependent Networks , 2004 .

[5]  Chandra R. Chegireddy,et al.  Algorithms for finding K-best perfect matchings , 1987, Discret. Appl. Math..

[6]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[7]  Paolo Toth,et al.  Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..

[8]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[9]  John E. Beasley,et al.  Linear Programming on Cray Supercomputers , 1990 .

[10]  K. G. Murty.  An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[13]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[14]  Jan van Leeuwen,et al.  Interval Heaps , 1993, Comput. J..

[15]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[16]  H. W. Kuhn,et al.  Variants of the hungarian method for assignment problems , 1956 .

[17]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[18]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[20]  João C. N. Clímaco,et al.  A note on a new variant of Murty’s ranking assignments algorithm , 2003, 4OR.

[21]  Anthony Przybylski,et al.  The Biobjective Assignment Problem , 2006 .

[22]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[23]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.