Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
Home
Publications
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
Author:
RG
Robert S. Garfinkel
Robert S. Garfinkel
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 December 1971
journal article
Published by
Institute for Operations Research and the Management Sciences (INFORMS)
in
Operations Research
Vol. 19
(7)
,
1747-1751
DOI:
10.1287/opre.19.7.1747
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.
Keywords
IMPROVED ALGORITHM
TECHNICAL NOTE
SUPERIOR COMPUTATIONALLY
PROBLEM GROSS
NOTE REPORTS
THRESHOLD
Related articles
Cited
Cited by 108 articles
Scroll to top