Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

Robert S. Garfinkel
Additional contact information
Robert S. Garfinkel: The University of Rochester, Rochester, New York

Operations Research, 1971, vol. 19, issue 7, 1747-1751

Abstract: Gross has proposed an algorithm for the bottleneck assignment problem. This note reports a test of it against a “threshold” algorithm, and finds that the latter is superior computationally.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1747 (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:19:y:1971:i:7:p:1747-1751

Access Statistics for this article

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