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

Network simplex algorithm for the general equal flow problem

Author

Listed:
  • Calvete, Herminia I.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:150:y:2003:i:3:p:585-600
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00505-2
    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. 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.
    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. 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.
    4. Fred Shepardson & Roy E. Marsten, 1980. "A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem," Management Science, INFORMS, vol. 26(3), pages 274-281, March.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. P. Beraldi & F. Guerriero & R. Musmanno, 1997. "Efficient Parallel Algorithms for the Minimum Cost Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 501-530, December.
    12. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1992. "Use of representative operation counts in computational testings of algorithms," Working papers 3459-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    14. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
    15. Herminia Calvete & Lourdes del-Pozo & José Iranzo, 2012. "Algorithms for the quickest path problem and the reliable quickest path problem," Computational Management Science, Springer, vol. 9(2), pages 255-272, May.
    16. Avinash Unnikrishnan & Varunraj Valsaraj & Steven Waller, 2009. "Stochastic and Dynamic Shipper Carrier Network Design Problem," Networks and Spatial Economics, Springer, vol. 9(4), pages 525-550, December.
    17. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.
    18. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    19. Mingue SUn, 2010. "A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems," Working Papers 0007, College of Business, University of Texas at San Antonio.
    20. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, 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:eee:ejores:v:150:y:2003:i:3:p:585-600. 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.