Technical Note—A “Hard” Assignment Problem

Robert E. Machol and Michael Wien
Additional contact information
Robert E. Machol: Northwestern University, Evanston, Illinois
Michael Wien: Northwestern University, Evanston, Illinois

Operations Research, 1976, vol. 24, issue 1, 190-192

Abstract: We construct numerical examples that force Hungarian-method algorithms for the assignment problem to their worst-case time bounds. These bounds are thereby clarified.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.1.190 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:1:p:190-192

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().