IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v65y2016i1d10.1007_s10589-016-9836-y.html
   My bibliography  Save this article

Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems

Author

Listed:
  • Markus Leitner

    (University of Vienna)

Abstract

In this article, we introduce the Generalized $$\{0,1,2\}$$ { 0 , 1 , 2 } -Survivable Network Design Problem ( $$\{0,1,2\}$$ { 0 , 1 , 2 } -GSNDP) which has applications in the design of backbone networks. Different mixed integer linear programming formulations are derived by combining previous results obtained for the related $$\{0,1,2\}$$ { 0 , 1 , 2 } -GSNDP and Generalized Network Design Problems. An extensive computational study comparing the correspondingly developed branch-and-cut approaches shows clear advantages for two particular variants. Additional insights into individual advantages and disadvantages of the developed algorithms for different instance characteristics are given.

Suggested Citation

  • Markus Leitner, 2016. "Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems," Computational Optimization and Applications, Springer, vol. 65(1), pages 73-92, September.
    • Handle: RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9836-y
    DOI: 10.1007/s10589-016-9836-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-016-9836-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-016-9836-y?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
    ---><---

    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. Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.
    2. Pop, Petrica C. & Kern, W. & Still, G., 2006. "A new relaxation method for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 170(3), pages 900-908, May.
    3. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    4. Bruce Golden & S. Raghavan & Daliborka Stanojević, 2005. "Heuristic Search for the Generalized Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 290-304, August.
    5. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    6. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    Full references (including those not matched with items on IDEAS)

    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. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    2. F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi, 2018. "A two-level metaheuristic for the all colors shortest path problem," Computational Optimization and Applications, Springer, vol. 71(2), pages 525-551, November.
    3. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    4. Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.
    5. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 0. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    6. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 2020. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 636-659, October.
    7. Pop, Petrică C. & Matei, Oliviu & Sabo, Cosmin & Petrovan, Adrian, 2018. "A two-level solution approach for solving the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 478-487.
    8. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    9. Mehmet Berkehan Akçay & Hüseyin Akcan & Cem Evrendilek, 2018. "All Colors Shortest Path problem on trees," Journal of Heuristics, Springer, vol. 24(4), pages 617-644, August.
    10. Cosmin Sabo & Petrică C. Pop & Andrei Horvat-Marc, 2020. "On the Selective Vehicle Routing Problem," Mathematics, MDPI, vol. 8(5), pages 1-11, May.
    11. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.
    12. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    13. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    14. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    15. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    16. Jorge Riera-Ledesma & Juan-José Salazar-González, 2006. "Solving the asymmetric traveling purchaser problem," Annals of Operations Research, Springer, vol. 144(1), pages 83-97, April.
    17. Garijo, Delia & Márquez, Alberto & Rodríguez, Natalia & Silveira, Rodrigo I., 2019. "Computing optimal shortcuts for networks," European Journal of Operational Research, Elsevier, vol. 279(1), pages 26-37.
    18. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    19. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    20. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.

    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:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9836-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.