A new algorithm for the assignment problem

Research output: Contribution to journalArticlepeer-review

150 Scopus citations

Abstract

We propose a new algorithm for the classical assignment problem. The algorithm resembles in some ways the Hungarian method but differs substantially in other respects. The average computational complexity of an efficient implementation of the algorithm seems to be considerably better than the one of the Hungarian method. In a large number of randomly generated problems the algorithm has consistently outperformed an efficiently coded version of the Hungarian method by a broad margin. The factor of improvement increases with the problem dimension N and reaches an order of magnitude for N equal to several hundreds.

Original languageEnglish (US)
Pages (from-to)152-171
Number of pages20
JournalMathematical Programming
Volume21
Issue number1
DOIs
StatePublished - Dec 1981
Externally publishedYes

Keywords

  • Assignment Problems
  • Computational Complexity
  • Hungarian Method
  • Network Flows

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'A new algorithm for the assignment problem'. Together they form a unique fingerprint.

Cite this