Aarhus University Seal / Aarhus Universitets segl

An algorithm for ranking assignments using reoptimization

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

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. Computational results for the new algorithm are presented
Original languageEnglish
JournalComputers & Operations Research
Pages (from-to)3714-3726
Number of pages13
Publication statusPublished - 2008

    Research areas

  • Linear assignment problem, Ranking, K best solutions

See relations at Aarhus University Citationformats

ID: 676292