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

Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem

Author

Listed:
  • Leon F. McGinnis

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

State-of-the-art computational results have shown that primal simplex algorithms are more efficient than primal-dual algorithms for general minimum cost network flow problems. There is, however, some controversy concerning their relative merits for solving assignment problems. This paper presents a detailed development for a computationally efficient primal-dual algorithm and extensive computational comparisons to primal simplex algorithms.

Suggested Citation

  • Leon F. McGinnis, 1983. "Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem," Operations Research, INFORMS, vol. 31(2), pages 277-291, April.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:2:p:277-291
    DOI: 10.1287/opre.31.2.277
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.2.277
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.2.277?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. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    2. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    3. 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.

    More about this item

    Keywords

    481 assignment algorithms;

    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:31:y:1983:i:2:p:277-291. 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.