IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i3p393-414.html
   My bibliography  Save this article

A new polynomial algorithm for maximum value flow with an efficient parallel implementation

Author

Listed:
  • Gary R. Waissi

Abstract

A new algorithm is presented for finding maximal and maximum value flows in directed single‐commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc.

Suggested Citation

  • Gary R. Waissi, 1993. "A new polynomial algorithm for maximum value flow with an efficient parallel implementation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 393-414, April.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:3:p:393-414
    DOI: 10.1002/1520-6750(199304)40:33.0.CO;2-1
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199304)40:33.0.CO;2-1
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199304)40:33.0.CO;2-1?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
    ---><---

    References listed on IDEAS

    as
    1. R. K. Ahuja & James B. Orlin, 1989. "A Fast and Simple Algorithm for the Maximum Flow Problem," Operations Research, INFORMS, vol. 37(5), pages 748-759, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahuja, Ravindra K., 1956-, 1995. "Computational investigations of maximum flow algorithms," Working papers 3811-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    3. Dorit S. Hochbaum & Anna Chen, 2000. "Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem," Operations Research, INFORMS, vol. 48(6), pages 894-914, December.
    4. Ravindra K. Ahuja & James B. Orlin, 1991. "Distance‐directed augmenting path algorithms for maximum flow and parametric maximum flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 413-430, June.
    5. Antonio Sedeño‐Noda & Carlos González‐Martín, 2000. "A O(nm log(U/n)) time maximum flow algorithm," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(6), pages 511-520, September.
    6. Ahuja, Ravindra K. & Kodialam, Murali & Mishra, Ajay K. & Orlin, James B., 1997. "Computational investigations of maximum flow algorithms," European Journal of Operational Research, Elsevier, vol. 97(3), pages 509-542, March.
    7. E. M. U. S. B. Ekanayake & W. B. Daundasekara & S. P. C. Perera, 2022. "New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems," Modern Applied Science, Canadian Center of Science and Education, vol. 16(1), pages 1-30, February.

    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:wly:navres:v:40:y:1993:i:3:p:393-414. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.