An algorithm for ranking assignments using reoptimization
From MaRDI portal
Publication:2483518
DOI10.1016/j.cor.2007.04.008zbMath1171.90449OpenAlexW2018962602MaRDI QIDQ2483518
Christian Roed Pedersen, Lars Relund Nielsen, 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
Related Items (6)
Exact solution approaches for bilevel assignment problems ⋮ BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Critical edges for the assignment problem: complexity and exact resolution ⋮ Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
Uses Software
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
This page was built for publication: An algorithm for ranking assignments using reoptimization
