IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v97y1997i3p509-542.html
   My bibliography  Save this article

Computational investigations of maximum flow algorithms

Author

Listed:
  • Ahuja, Ravindra K.
  • Kodialam, Murali
  • Mishra, Ajay K.
  • Orlin, James B.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:97:y:1997:i:3:p:509-542
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00269-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mazzoni, Giuseppe & Pallottino, Stefano & Scutella, Maria Grazia, 1991. "The maximum flow problem: A max-preflow approach," European Journal of Operational Research, Elsevier, vol. 53(3), pages 257-278, August.
    2. Giorgio Gallo & Maria Grazia Scutellà, 1993. "Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations," INFORMS Journal on Computing, INFORMS, vol. 5(2), pages 120-133, May.
    3. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    4. 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.
    5. 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.
    6. Ravindra K. Ahuja & James B. Orlin, 1996. "Use of Representative Operation Counts in Computational Testing of Algorithms," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 318-330, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiu-Zhen Xu & Yi-Feng Niu & Qing Li, 2019. "Efficient Enumeration of - Minimal Paths in Reliability Evaluation of Multistate Networks," Complexity, Hindawi, vol. 2019, pages 1-10, March.
    2. Lee, Dongkyu & Song, Junho, 2023. "Risk-informed operation and maintenance of complex lifeline systems using parallelized multi-agent deep Q-network," Reliability Engineering and System Safety, Elsevier, vol. 239(C).
    3. Niu, Yi-Feng & Wan, Xiao-Yu & Xu, Xiu-Zhen & Ding, Dong, 2020. "Finding all multi-state minimal paths of a multi-state flow network via feasible circulations," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    4. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "A new efficient algorithm for finding all d-minimal cuts in multi-state networks," Reliability Engineering and System Safety, Elsevier, vol. 166(C), pages 151-163.
    5. Cole Smith, J., 2004. "Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network," European Journal of Operational Research, Elsevier, vol. 154(3), pages 659-672, May.
    6. Alipour, Hossein & Muñoz, Mario Andrés & Smith-Miles, Kate, 2023. "Enhanced instance space analysis for the maximum flow problem," European Journal of Operational Research, Elsevier, vol. 304(2), pages 411-428.
    7. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    8. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    9. A. Sedeño-Noda & M. González-Sierra & C. González-Martín, 2000. "An algorithmic study of the Maximum Flow problem: A comparative statistical analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 135-162, June.
    10. Megha Sharma & Diptesh Ghosh, 2010. "Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks," Working Papers id:2698, eSocialSciences.
    11. Lysgaard, Jens, 2006. "Reachability cuts for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(1), pages 210-223, November.
    12. Chin‐Chia Jane & Yih‐Wenn Laih, 2012. "Evaluating cost and reliability integrated performance of stochastic logistics systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 577-586, October.
    13. Lysgaard, Jens, 2004. "Reachability cuts for the vehicle routing problem with time windows," CORAL Working Papers L-2004-01, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    14. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "Evaluating the reliability of a stochastic distribution network in terms of minimal cuts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 75-97.
    15. Bala G. Chandran & Dorit S. Hochbaum, 2009. "A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem," Operations Research, INFORMS, vol. 57(2), pages 358-376, April.
    16. Niu, Yi-Feng & Lam, William H.K. & Gao, Ziyou, 2014. "An efficient algorithm for evaluating logistics network reliability subject to distribution cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 175-189.

    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. 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.
    3. A. Sedeño-Noda & M. González-Sierra & C. González-Martín, 2000. "An algorithmic study of the Maximum Flow problem: A comparative statistical analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 135-162, June.
    4. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    5. 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.
    6. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    7. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    8. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    9. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    10. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    11. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
    12. R. Fourer & H. Gassmann & J. Ma & R. Martin, 2009. "An XML-based schema for stochastic programs," Annals of Operations Research, Springer, vol. 166(1), pages 313-337, February.
    13. Maya Duque, Pablo A. & Coene, Sofie & Goos, Peter & Sörensen, Kenneth & Spieksma, Frits, 2013. "The accessibility arc upgrading problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 458-465.
    14. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    15. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
    16. Mongeau, Marcel & Sartenaer, Annick, 1995. "Automatic decrease of the penalty parameter in exact penalty function methods," European Journal of Operational Research, Elsevier, vol. 83(3), pages 686-699, June.
    17. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    18. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    19. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    20. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.

    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:eee:ejores:v:97:y:1997:i:3:p:509-542. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.