An algorithm for ranking assignments using reoptimization

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 techn...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2008-11, Vol.35 (11), p.3714-3726
Hauptverfasser:	Pedersen, Christian Roed, Relund Nielsen, Lars, Andersen, Kim Allan
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Assignment problem Exact sciences and technology K best solutions Linear assignment problem Operational research. Management science Optimization algorithms Optimization techniques Ranking Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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. Its computational performance is compared with all available implementations of algorithms with the same time complexity. The results are encouraging.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2007.04.008