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

The Cut Search Algorithm with Arc Capacities and Lower Bounds

Author

Listed:
  • Steve Phillips, Jr.

    (University of Texas at Arlington)

  • Mohamed I. Dessouky

    (University of Illinois)

Abstract

This paper presents a computational procedure for solving maximal flow problems in flow networks subject to positive upper bound or capacity constraints and lower bound restrictions that are equal to or greater than zero. This procedure, referred to as the cut search algorithm, locates directly the minimal cut in a flow network structure. The algorithm not only has demonstrated computational efficiency over the existing out-of-kilter procedure, but also it provides a direct solution routine for project time/cost tradeoff problems and other network cut based problem situations in which the restricting arcs of the network formulation must be located.

Suggested Citation

  • Steve Phillips, Jr. & Mohamed I. Dessouky, 1979. "The Cut Search Algorithm with Arc Capacities and Lower Bounds," Management Science, INFORMS, vol. 25(4), pages 396-404, April.
    • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:4:p:396-404
    DOI: 10.1287/mnsc.25.4.396
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.4.396
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.25.4.396?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. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.

    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:25:y:1979:i:4:p:396-404. 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.