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

The multi-layered network design problem

Author

Listed:
  • Knippel, Arnaud
  • Lardeux, Benoit

Abstract

No abstract is available for this item.

Suggested Citation

  • Knippel, Arnaud & Lardeux, Benoit, 2007. "The multi-layered network design problem," European Journal of Operational Research, Elsevier, vol. 183(1), pages 87-99, November.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:1:p:87-99
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01011-3
    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. Geir Dahl & Mechthild Stoer, 1998. "A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 1-11, February.
    2. 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.
    3. Michel Minoux, 2001. "Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods," Annals of Operations Research, Springer, vol. 106(1), pages 19-46, September.
    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. Sara Mattia, 2010. "Solving Survivable Two-Layer Network Design Problems by Metric Inequalities," DIS Technical Reports 2010-02, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. Sara Mattia, 2012. "Solving survivable two-layer network design problems by metric inequalities," Computational Optimization and Applications, Springer, vol. 51(2), pages 809-834, March.
    3. Carayannis, Elias G. & Grigoroudis, Evangelos & Wurth, Bernd, 2022. "OR for entrepreneurial ecosystems: A problem-oriented review and agenda," European Journal of Operational Research, Elsevier, vol. 300(3), pages 791-808.
    4. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.

    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. Sara Mattia, 2012. "Solving survivable two-layer network design problems by metric inequalities," Computational Optimization and Applications, Springer, vol. 51(2), pages 809-834, March.
    2. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    3. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    4. 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.
    5. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    6. Anantaram Balakrishnan & Prakash Mirchandani & Harihara Prasad Natarajan, 2009. "Connectivity Upgrade Models for Survivable Network Design," Operations Research, INFORMS, vol. 57(1), pages 170-186, February.
    7. Agarwal, Y.K. & Venkateshan, Prahalad, 2014. "Survivable network design with shared-protection routing," European Journal of Operational Research, Elsevier, vol. 238(3), pages 836-845.
    8. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    9. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    10. Alain Hertz & Thomas Ridremont, 2020. "A tabu search for the design of capacitated rooted survivable planar networks," Journal of Heuristics, Springer, vol. 26(6), pages 829-850, December.
    11. Kathryn M. Schumacher & Richard Li‐Yang Chen & Amy E.M. Cohn & Jeremy Castaing, 2016. "Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(3), pages 236-246, April.
    12. Anantaram Balakrishnan & Thomas L. Magnanti & Joel S. Sokol & Yi Wang, 2002. "Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type," Operations Research, INFORMS, vol. 50(4), pages 617-635, August.
    13. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    14. 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.
    15. Michał Pióro & Yoann Fouquet & Dritan Nace & Michael Poss, 2016. "Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity," Operations Research, INFORMS, vol. 64(2), pages 273-289, April.
    16. Ozgur Kabadurmus & Alice E. Smith, 2016. "Multi-commodity k-splittable survivable network design problems with relays," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(1), pages 123-133, May.
    17. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    18. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    19. C S Sung & S H Song, 2003. "Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 72-82, January.
    20. Kennington, Jeffery L. & Olinick, Eli V. & Spiride, Gheorghe, 2007. "Basic mathematical programming models for capacity allocation in mesh-based survivable networks," Omega, Elsevier, vol. 35(6), pages 629-644, 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:eee:ejores:v:183:y:2007:i:1:p:87-99. 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.