IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1391.html
   My bibliography  Save this paper

Minimum cost capacity installation for multicommodity network flows

Author

Listed:
  • BIENSTOCK, Daniel
  • CHOPRA, Sunil
  • GÜNLÜK, Oktay
  • TSAI, Chih-Yang

Abstract

No abstract is available for this item.

Suggested Citation

  • BIENSTOCK, Daniel & CHOPRA, Sunil & GÜNLÜK, Oktay & TSAI, Chih-Yang, 1998. "Minimum cost capacity installation for multicommodity network flows," LIDAM Reprints CORE 1391, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1391
    DOI: 10.1007/BF01581104
    Note: In : Mathematical Programming, 81, 177-199, 1998
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1007/BF01581104
    Download Restriction: no
    File URL: https://libkey.io/10.1007/BF01581104?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
    ---><---

    Citations

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


    Cited by:

    1. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    2. Jack Brimberg & Pierre Hansen & Keh-Wei Lin & Nenad Mladenović & MichÈle Breton, 2003. "An Oil Pipeline Design Problem," Operations Research, INFORMS, vol. 51(2), pages 228-239, April.
    3. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    4. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
    5. Ioannis Gamvros & Bruce Golden & S. Raghavan, 2006. "The Multilevel Capacitated Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 348-365, August.
    6. Ada Suk‐fung Ng & Trilochan Sastry & Janny M.Y. Leung & X.Q. Cai, 2004. "On the uncapacitated K‐commodity network design problem with zero flow‐costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1149-1172, December.
    7. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    8. Sara Mattia & Michael Poss, 2018. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation," Computational Optimization and Applications, Springer, vol. 69(3), pages 753-800, April.
    9. Bernard Fortz & Martine Labbé & Francesco Maffioli, 2000. "Solving the Two-Connected Network with Bounded Meshes Problem," Operations Research, INFORMS, vol. 48(6), pages 866-877, December.
    10. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware, 2002. "Composite Variable Formulations for Express Shipment Service Network Design," Transportation Science, INFORMS, vol. 36(1), pages 1-20, February.
    11. F. Sibel Salman & R. Ravi & John N. Hooker, 2008. "Solving the Capacitated Local Access Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 243-254, May.
    12. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.
    13. Zuo‐Jun Max Shen & Jia Shu & David Simchi‐Levi & Chung‐Piaw Teo & Jiawei Zhang, 2009. "Approximation algorithms for general one‐warehouse multi‐retailer systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(7), pages 642-658, October.
    14. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    15. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    16. Moon, Mark A. & Mentzer, John T. & Smith, Carlo D., 2003. "Conducting a sales forecasting audit," International Journal of Forecasting, Elsevier, vol. 19(1), pages 5-25.
    17. Daniel Bienstock & Olga Raskina & Iraj Saniee & Qiong Wang, 2006. "Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation," Operations Research, INFORMS, vol. 54(2), pages 261-276, April.
    18. Yogesh Kumar Agarwal & Prahalad Venkateshan, 2019. "New Valid Inequalities for the Optimal Communication Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 268-284, April.
    19. Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
    20. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    21. Geir Dahl & Alexander Martin & Mechthild Stoer, 1999. "Routing Through Virtual Paths in Layered Telecommunication Networks," Operations Research, INFORMS, vol. 47(5), pages 693-702, October.
    22. Agarwal, Y.K. & Aneja, Y.P., 2017. "Fixed charge multicommodity network design using p-partition facets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 124-135.
    23. Shaileshh Bojja Venkatakrishnan & Mohammad Alizadeh & Pramod Viswanath, 2018. "Costly circuits, submodular schedules and approximate Carathéodory Theorems," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 311-347, April.
    24. Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.

    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:cor:louvrp:1391. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.