An algorithm for ranking assignments using reoptimization

DOI10.1016/j.cor.2007.04.008zbMath1171.90449MaRDI QIDQ2483518

Lars Relund Nielsen, Christian Roed Pedersen, Kim Allan Andersen

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.04.008

zbMATH Keywords

ranking; linear assignment problem; \(K\) best solutions

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithms for finding k-best perfect matchings
• A note on a new variant of Murty's ranking assignments algorithm
• Algorithms and codes for dense assignment problems: The state of the art
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• Linear Programming on Cray Supercomputers
• Interval Heaps
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• On some techniques useful for solution of transportation network problems