IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v19y1973i9p1042-1051.html
   My bibliography  Save this article

An Efficient Minimal Cost Flow Algorithm

Author

Listed:
  • G. E. Bennington

    (North Carolina State University)

Abstract

One of the methods of solving the minimal cost flow problem is to find cycles of negative length in a marginal cost network. These negative cycles indicate a change in the flows around the cycle, which will result in a reduction in the total cost. The proposed method finds negative cycles by attempting to find the shortest chains from a fixed node to all other nodes. Results of computational experiments comparing this algorithm with the out-of-kilter algorithm are presented. These results indicate that the proposed method of repetitively detecting negative cycles yields an efficient minimal cost flow algorithm.

Suggested Citation

  • G. E. Bennington, 1973. "An Efficient Minimal Cost Flow Algorithm," Management Science, INFORMS, vol. 19(9), pages 1042-1051, May.
    • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:9:p:1042-1051
    DOI: 10.1287/mnsc.19.9.1042
    as

    Download full text from publisher

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

    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:ormnsc:v:19:y:1973:i:9:p:1042-1051. 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.