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

DOI10.1016/j.cor.2009.04.009zbMath1279.90098OpenAlexW2055012288MaRDI QIDQ732917

Christian Roed Pedersen, Kim Allan Andersen, Lars Relund Nielsen

Publication date: 15 October 2009

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

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (2)

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

Uses Software

• OR-Library

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An algorithm for ranking assignments using reoptimization
• Linear Programming on Cray Supercomputers
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]