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

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Author

Listed:
  • James B. Orlin

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O ( n log n ) shortest path problems on networks with n nodes and m arcs and runs in O ( n log n ( m + n log n )) time. Using a standard transformation, this approach yields an O ( m log n ( m + n log n )) algorithm for the capacitated minimum cost flow problem. This algorithm improves the best previous strongly polynomial time algorithm, due to Z. Galil and E. Tardos, by a factor of n 2 / m . Our algorithm for the capacitated minimum cost flow problem is even more efficient if the number of arcs with finite upper bounds, say m ′, is much less than m . In this case, the running time of the algorithm is O (( m ′ + n ) log n ( m + n log n )).

Suggested Citation

  • James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:2:p:338-350
    DOI: 10.1287/opre.41.2.338
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.2.338
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.2.338?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
    ---><---

    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:41:y:1993:i:2:p:338-350. 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.