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

Algorithms for the Simple Equal Flow Problem

Author

Listed:
  • Ravindra K. Ahuja

    (Department of Industrial & Systems Engineering, University of Florida, Gainesville, Florida 32611)

  • James B. Orlin

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Giovanni M. Sechi

    (Department of Hydraulics, University of Cagliari, 09123 Cagliari, Sardinia, Italy)

  • Paola Zuddas

    (Department of Hydraulics, University of Cagliari, 09123 Cagliari, Sardinia, Italy)

Abstract

The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in order to satisfy demands at certain nodes from available supplies at other nodes. In this paper, we study a variant of the minimum cost flow problem where we are given a set R \subseteq A of arcs and require that each arc in R must carry the same amount of flow. This problem, which we call the simple equal flow problem, arose while modeling a water resource system management in Sardinia, Italy. We consider the simple equal flow problem in a directed network with n nodes, m arcs, and where all arc capacities and node supplies are integer and bounded by U. We develop several algorithms for the simple equal flow problem---the network simplex algorithm, the parametric simplex algorithm, the combinatorial parametric algorithm, the binary search algorithm, and the capacity scaling algorithm. The binary search algorithm solves the simple equal flow problem in O(log(nU)) applications of any minimum cost flow algorithm. The capacity scaling algorithm solves it in O(m(m + n logn) log (nU)) time, which is almost the same time needed to solve the minimum cost flow problem by the capacity scaling algorithm. These algorithms can be easily modified to obtain an integer solution of the simple equal flow problem.

Suggested Citation

  • Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
    • Handle: RePEc:inm:ormnsc:v:45:y:1999:i:10:p:1440-1455
    DOI: 10.1287/mnsc.45.10.1440
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.45.10.1440
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.45.10.1440?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. Éva Tardos, 1986. "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, INFORMS, vol. 34(2), pages 250-256, April.
    2. Ali, Agha Iqbal & Kennington, Jeff & Shetty, Bala, 1988. "The equal flow problem," European Journal of Operational Research, Elsevier, vol. 36(1), pages 107-115, July.
    3. Carraresi, P. & Gallo, G., 1984. "Network models for vehicle and crew scheduling," European Journal of Operational Research, Elsevier, vol. 16(2), pages 139-151, May.
    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. Giovanni M. Sechi & Riccardo Zucca, 2017. "A Cost-Simulation Approach to Finding Economic Optimality in Leakage Reduction for Complex Supply Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(14), pages 4601-4615, November.
    2. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.
    3. Haiyan Lu & Enyu Yao & Liqun Qi, 2006. "Some further results on minimum distribution cost flow problems," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 351-371, June.
    4. Kaul, Hemanshu & Rumpf, Adam, 2022. "A linear input dependence model for interdependent networks," European Journal of Operational Research, Elsevier, vol. 302(2), pages 781-797.
    5. Gensler, Sonja & Hinz, Oliver & Skiera, Bernd & Theysohn, Sven, 2012. "Willingness-to-pay estimation with choice-based conjoint analysis: Addressing extreme response behavior with individually adapted designs," European Journal of Operational Research, Elsevier, vol. 219(2), pages 368-378.
    6. Calvete, Herminia I., 2003. "Network simplex algorithm for the general equal flow problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 585-600, November.
    7. Giovanni Sechi & Paola Zuddas, 2008. "Multiperiod Hypergraph Models for Water Systems Optimization," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 22(3), pages 307-320, March.
    8. I N Kamal Abadi, 2007. "A new algorithm for minimizing makespan, C max, in blocking flow-shop problem through slowing down the operations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 134-140, January.
    9. Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.
    10. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    11. Jia Shu & Mabel C. Chou & Qizhang Liu & Chung-Piaw Teo & I-Lin Wang, 2013. "Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems," Operations Research, INFORMS, vol. 61(6), pages 1346-1359, December.
    12. Antonio Manca & Giovanni Sechi & Paola Zuddas, 2010. "Water Supply Network Optimisation Using Equal Flow Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(13), pages 3665-3678, October.

    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-, 1997. "Algorithms for the simple equal flow problem," Working papers WP 3960-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.
    3. Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
    4. Kulkarni, Sarang & Krishnamoorthy, Mohan & Ranade, Abhiram & Ernst, Andreas T. & Patil, Rahul, 2018. "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 457-487.
    5. Amitai Armon & Iftah Gamzu & Danny Segev, 2014. "Mobile facility location: combinatorial filtering via weighted occupancy," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 358-375, August.
    6. Vaidyanathan, Balachandran, 2007. "Multi-Commodity Network Flow Based Approaches for the Railroad Crew Scheduling Problem," 48th Annual Transportation Research Forum, Boston, Massachusetts, March 15-17, 2007 207928, Transportation Research Forum.
    7. Gábor Maróti & Leo Kroon, 2005. "Maintenance Routing for Train Units: The Transition Model," Transportation Science, INFORMS, vol. 39(4), pages 518-525, November.
    8. László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
    9. Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
    10. Ilan Adler & Martin Bullinger & Vijay V. Vazirani, 2024. "A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games," Papers 2410.10767, arXiv.org.
    11. Cai Mao-Cheng, 1999. "Inverse Problems of Matroid Intersection," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 465-474, December.
    12. Benchimol, Pascal & Desaulniers, Guy & Desrosiers, Jacques, 2012. "Stabilized dynamic constraint aggregation for solving set partitioning problems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 360-371.
    13. Blanco, Víctor & Conde, Eduardo & Hinojosa, Yolanda & Puerto, Justo, 2020. "An optimization model for line planning and timetabling in automated urban metro subway networks. A case study," Omega, Elsevier, vol. 92(C).
    14. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    15. Carraresi, Paolo & Malucelli, Federico & Pallottino, Stefano, 1996. "Regional mass transit assignment with resource constraints," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 81-98, April.
    16. Ching-Chung Kuo, 2011. "Optimal assignment of resources to strengthen the weakest link in an uncertain environment," Annals of Operations Research, Springer, vol. 186(1), pages 159-173, June.
    17. Equi, Luisa & Gallo, Giorgio & Marziale, Silvia & Weintraub, Andres, 1997. "A combined transportation and scheduling problem," European Journal of Operational Research, Elsevier, vol. 97(1), pages 94-104, February.
    18. Dipti Dubey & S. K. Neogy, 2020. "On solving a non-convex quadratic programming problem involving resistance distances in graphs," Annals of Operations Research, Springer, vol. 287(2), pages 643-651, April.
    19. Cai Mao-Cheng & Yanjun Li, 1997. "Inverse Matroid Intersection Problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(2), pages 235-243, June.
    20. Yenisey, Mehmet Mutlu, 2006. "A flow-network approach for equilibrium of material requirements planning," International Journal of Production Economics, Elsevier, vol. 102(2), pages 317-332, August.

    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:45:y:1999:i:10:p:1440-1455. 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: 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.