IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v20y1990i4p133-149.html
   My bibliography  Save this article

The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial

Author

Listed:
  • Dimitri P. Bertsekas

    (Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

The auction algorithm is an intuitive method for solving the classical assignment problem. It outperforms substantially its main competitors for important types of problems, both in theory and in practice and is also naturally well suited for parallel computation. I derive the algorithm from first principles, explain its computational properties, and discuss its extensions to transportation and transshipment problems.

Suggested Citation

  • Dimitri P. Bertsekas, 1990. "The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 133-149, August.
    • Handle: RePEc:inm:orinte:v:20:y:1990:i:4:p:133-149
    DOI: 10.1287/inte.20.4.133
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.20.4.133
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.20.4.133?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. Lorenzo Castelli & Raffaele Pesenti & Andrea Ranieri, 2009. "Allocating Air Traffic Flow Management Slots," Working Papers 191, Department of Applied Mathematics, Università Ca' Foscari Venezia.
    2. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2007. "A Market-Based Optimization Algorithm for Distributed Systems," Management Science, INFORMS, vol. 53(8), pages 1345-1358, August.
    3. Orlin, James B., 1953- & Lee, Yusin., 1993. "QuickMatch--a very fast algorithm for the assignment problem," Working papers 3547-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Ming Fan & Jan Stallaert & Andrew B. Whinston, 2003. "Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market," Information Systems Research, INFORMS, vol. 14(1), pages 1-22, March.
    5. Kim, Jindae & Ok, Chang-Soo & Kumara, Soundar & Yee, Shang-Tae, 2010. "A market-based approach for dynamic vehicle deployment planning using radio frequency identification (RFID) information," International Journal of Production Economics, Elsevier, vol. 128(1), pages 235-247, November.
    6. He, Fang & Yin, Yafeng & Chen, Zhibin & Zhou, Jing, 2015. "Pricing of parking games with atomic players," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 1-12.

    More about this item

    Keywords

    programming: mathematical; networks/graphs;

    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:orinte:v:20:y:1990:i:4:p:133-149. 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.