IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i7p1747-1751.html
   My bibliography  Save this article

Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

Author

Listed:
  • Robert S. Garfinkel

    (The University of Rochester, Rochester, New York)

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.

Suggested Citation

  • Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1747-1751
    DOI: 10.1287/opre.19.7.1747
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.7.1747
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.7.1747?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    2. Niclas Boehmer & Robert Bredereck & Piotr Faliszewski & Andrzej Kaczmarczyk & Rolf Niedermeier, 2020. "Line-Up Elections: Parallel Voting with Shared Candidate Pool," Papers 2007.04960, arXiv.org.
    3. Ekta Jain & Kalpana Dahiya & Anuj Sharma & Vanita Verma, 2019. "An improved algorithm for two stage time minimization assignment problem," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 713-736, February.
    4. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    5. Barbara M. Anthony & Christine Chung, 2016. "Serve or skip: the power of rejection in online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1232-1253, November.
    6. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the solution of a stochastic bottleneck assignment problem and its variations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 389-397, April.
    7. Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
    8. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1747-1751. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.