An algorithm for ranking assignments using reoptimization
From MaRDI portal
Publication:2483518
DOI10.1016/J.COR.2007.04.008zbMATH Open1171.90449OpenAlexW2018962602MaRDI QIDQ2483518FDOQ2483518
Authors: 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
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Algorithms for finding k-best perfect matchings
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Algorithms and codes for dense assignment problems: The state of the art
- A note on a new variant of Murty's ranking assignments algorithm
- Title not available (Why is that?)
- Linear Programming on Cray Supercomputers
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- Title not available (Why is that?)
- Interval Heaps
Cited In (11)
- A rank-based approach to the sequential selection and assignment problem
- Exact solution approaches for bilevel assignment problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
- A versatile scheme for ranking the extreme points of an assignment polytope
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- Critical edges for the assignment problem: complexity and exact resolution
- A generalization of the assignment problem, and its application to the rank aggregation problem
- Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
- Title not available (Why is that?)
- A note on a new variant of Murty's ranking assignments algorithm
Uses Software
This page was built for publication: An algorithm for ranking assignments using reoptimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483518)