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

Algorithms for network piecewise-linear programs: A comparative study

Author

Listed:
  • Marins, Fernando A. S.
  • Senne, Edson L. F.
  • Darby-Dowman, Ken
  • Machado, Arlene F.
  • Perin, Clovis

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:97:y:1997:i:1:p:183-199
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00109-9
    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. Agha Iqbal Ali & Rema Padman & Hemalatha Thiagarajan, 1989. "Dual Algorithms for Pure Network Problems," Operations Research, INFORMS, vol. 37(1), pages 159-171, February.
    2. Robert Fourer & Roy E. Marsten, 1992. "Solving Piecewise-Linear Programs: Experiments with a Simplex Approach," INFORMS Journal on Computing, INFORMS, vol. 4(1), pages 16-31, February.
    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. Mohammad M. Amini & Richard S. Barr, 1993. "Network Reoptimization Algorithms: A Statistically Designed Comparison," INFORMS Journal on Computing, INFORMS, vol. 5(4), pages 395-409, November.
    5. Andrew V. Goldberg & Robert E. Tarjan, 1990. "Finding Minimum-Cost Circulations by Successive Approximation," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 430-466, August.
    6. M. Collins & L. Cooper & R. Helgason & J. Kennington & L. LeBlanc, 1978. "Solving the Pipe Network Analysis Problem Using Optimization Techniques," Management Science, INFORMS, vol. 24(7), pages 747-760, March.
    7. Harvey J. Greenberg, 1990. "Computational Testing: Why, How and How Much," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 94-97, February.
    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. Pan, Shenle & Ballot, Eric & Fontane, Frédéric, 2013. "The reduction of greenhouse gas emissions from freight transport by pooling supply chains," International Journal of Production Economics, Elsevier, vol. 143(1), pages 86-94.

    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- & 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.
    2. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.
    3. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2000. "A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem," Transportation Science, INFORMS, vol. 34(3), pages 289-302, August.
    4. Marie Coffin & Matthew J. Saltzman, 2000. "Statistical Analysis of Computational Tests of Algorithms and Heuristics," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 24-44, February.
    5. Antonio Frangioni & Antonio Manca, 2006. "A Computational Study of Cost Reoptimization for Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 61-70, February.
    6. 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.
    7. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    8. Lars Schewe & Martin Schmidt & Johannes Thürauf, 2020. "Computing technical capacities in the European entry-exit gas market is NP-hard," Annals of Operations Research, Springer, vol. 295(1), pages 337-362, December.
    9. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    10. 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.
    11. 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.
    12. Durga Prasad Khanal & Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2022. "Efficient Algorithms for Abstract Flow with Partial Switching," SN Operations Research Forum, Springer, vol. 3(4), pages 1-17, December.
    13. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    14. 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.
    15. Brkic, Dejan, 2009. "An improvement of Hardy Cross method applied on looped spatial natural gas distribution networks," Applied Energy, Elsevier, vol. 86(7-8), pages 1290-1300, July.
    16. Hong, Sung-Pil & Kim, Taegyoon & Lee, Subin, 2019. "A precision pump schedule optimization for the water supply networks with small buffers," Omega, Elsevier, vol. 82(C), pages 24-37.
    17. J. David Allen & Richard V. Helgason & Jeffery L. Kennington, 1987. "The frequency assignment problem: A solution via nonlinear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(1), pages 133-139, February.
    18. 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.
    19. 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.
    20. 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.

    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:1:p:183-199. 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.