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

A specialized network simplex algorithm for the constrained maximum flow problem

Author

Listed:
  • ÇalIskan, Cenk

Abstract

The constrained maximum flow problem is to send the maximum flow from a source to a sink in a directed capacitated network where each arc has a cost and the total cost of the flow cannot exceed a budget. This problem is similar to some variants of classical problems such as the constrained shortest path problem, constrained transportation problem, or constrained assignment problem, all of which have important applications in practice. The constrained maximum flow problem itself has important applications, such as in logistics, telecommunications and computer networks. In this research, we present an efficient specialized network simplex algorithm that significantly outperforms the two widely used LP solvers: CPLEX and lp_solve. We report CPU times of an average of 27 times faster than CPLEX (with its dual simplex algorithm), the closest competitor of our algorithm.

Suggested Citation

  • Ç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.
    • Handle: RePEc:eee:ejores:v:210:y:2011:i:2:p:137-147
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00659-4
    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. W. H. Cunningham, 1979. "Theoretical Properties of the Network Simplex Method," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 196-208, May.
    2. D. R. Fulkerson, 1959. "Increasing the Capacity of a Network: The Parametric Budget Problem," Management Science, INFORMS, vol. 5(4), pages 472-483, July.
    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. F. Glover & D. Karney & D. Klingman & R. Russell, 1978. "Solving Singly Constrained Transshipment Problems," Transportation Science, INFORMS, vol. 12(4), pages 277-297, November.
    5. D. Klingman & R. Russell, 1978. "A streamlined simplex approach to the singly constrained transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(4), pages 681-695, December.
    6. Richard D. McBride & John W. Mamer, 1997. "Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 9(2), pages 154-163, May.
    7. Darwin Klingman, 1977. "Finding Equivalent Network Formulations for Constrained Network Problems," Management Science, INFORMS, vol. 23(7), pages 737-744, March.
    8. D. Klingman & R. Russell, 1975. "Solving Constrained Transportation Problems," Operations Research, INFORMS, vol. 23(1), pages 91-106, February.
    9. F. Glover & Darwin Klingman & G. Terry Ross, 1974. "Finding equivalent transportation formulations for constrained transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(2), pages 247-254, June.
    10. McBride, Richard D., 1985. "Solving embedded generalized network problems," European Journal of Operational Research, Elsevier, vol. 21(1), pages 82-92, July.
    11. Prahalad Venkateshan & Kamlesh Mathur & Ronald H. Ballou, 2008. "An efficient generalized network-simplex-based algorithm for manufacturing network flows," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 315-341, May.
    12. John W. Mamer & Richard D. McBride, 2000. "A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem," Management Science, INFORMS, vol. 46(5), pages 693-709, May.
    13. 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.
    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. Trust Tawanda & Philimon Nyamugure & Santosh Kumar & Elias Munapo, 2023. "An intelligent node labelling maximum flow algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(4), pages 1276-1284, August.

    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. Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos, 2022. "A novel approach to subgraph selection with multiple weights on arcs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 242-268, August.
    2. Holzhauser, Michael & Krumke, Sven O. & Thielen, Clemens, 2017. "A network simplex method for the budget-constrained minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 259(3), pages 864-872.
    3. Richard D. McBride & John W. Mamer, 2004. "Implementing an LU Factorization for the Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 109-119, May.
    4. 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.
    5. 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.
    6. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    7. 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.
    8. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    9. P. Chardaire & G. P. McKeown & S. A. Verity-Harrison & S. B. Richardson, 2005. "Solving a Time-Space Network Formulation for the Convoy Movement Problem," Operations Research, INFORMS, vol. 53(2), pages 219-230, April.
    10. Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
    11. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2017. "Maximum flows in generalized processing networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1226-1256, May.
    12. Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
    13. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, August.
    14. 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.
    15. Raúl Pérez-Fernández & Bernard De Baets, 2017. "Recursive Monotonicity of the Scorix: Borda Meets Condorcet," Group Decision and Negotiation, Springer, vol. 26(4), pages 793-813, July.
    16. Ahuja, Ravindra K., 1956- & Kanpur, I. I. T. & Orlin, James B., 1953-, 1993. "A capacity scaling algorithm for the constrained maximum flow problem," Working papers 3587-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    17. 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.
    18. Steven A. Gabriel & Supat Kiet & Jifang Zhuang, 2005. "A Mixed Complementarity-Based Equilibrium Model of Natural Gas Markets," Operations Research, INFORMS, vol. 53(5), pages 799-818, October.
    19. Pankaj Gupta & Mukesh Mehlawat, 2007. "An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 114-137, July.
    20. Gengjun Gao & Yuxuan Che & Jian Shen, 2021. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 866-883, November.

    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:210:y:2011:i:2:p:137-147. 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.