Khamphousone, Julien; Castaño, Fabian; Rossi, André; Toubaline, Sonia A survivable variant of the ring star problem. (English) Zbl 07819286 Networks 83, No. 2, 324-347 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{J. Khamphousone} et al., Networks 83, No. 2, 324--347 (2024; Zbl 07819286) Full Text: DOI
Chimani, Markus; Ilsen, Max Capacity-preserving subgraphs of directed flow networks. (English) Zbl 07781733 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 160-172 (2023). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{M. Chimani} and \textit{M. Ilsen}, Lect. Notes Comput. Sci. 13889, 160--172 (2023; Zbl 07781733) Full Text: DOI arXiv
Bentz, Cédric; Costa, Marie-Christine; Poirion, Pierre-Louis; Ridremont, Thomas Robust capacitated Steiner trees and networks with uniform demands. (English) Zbl 07780117 Networks 82, No. 1, 3-31 (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{C. Bentz} et al., Networks 82, No. 1, 3--31 (2023; Zbl 07780117) Full Text: DOI arXiv OA License
Luo, Haochen; Kianfar, Kiavash Valid inequalities and facets for multi-module survivable network design problem. (English) Zbl 07780108 Networks 81, No. 2, 155-176 (2023). MSC: 90B10 90C10 PDFBibTeX XMLCite \textit{H. Luo} and \textit{K. Kianfar}, Networks 81, No. 2, 155--176 (2023; Zbl 07780108) Full Text: DOI
Albareda-Sambola, Maria; Landete, Mercedes; Monge, Juan F.; Sainz-Pardo, José L. An exact approach for the reliable fixed-charge location problem with capacity constraints. (English) Zbl 07709921 Eur. J. Oper. Res. 311, No. 1, 24-35 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Albareda-Sambola} et al., Eur. J. Oper. Res. 311, No. 1, 24--35 (2023; Zbl 07709921) Full Text: DOI
Raayatpanah, Mohammad Ali; Kabiri Beheshtkhah, Mahdi; Eshghi, Farshad; Kelarestaghi, Manoochehr; Nepomuceno, Napoleão Design of survivable wireless backhaul networks with reliability considerations. (English) Zbl 07706539 Comput. Oper. Res. 151, Article ID 106120, 12 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. A. Raayatpanah} et al., Comput. Oper. Res. 151, Article ID 106120, 12 p. (2023; Zbl 07706539) Full Text: DOI
Pfetsch, Marc E.; Schmitt, Andreas A generic optimization framework for resilient systems. (English) Zbl 1515.90086 Optim. Methods Softw. 38, No. 2, 356-385 (2023). MSC: 90C17 90C26 90C57 PDFBibTeX XMLCite \textit{M. E. Pfetsch} and \textit{A. Schmitt}, Optim. Methods Softw. 38, No. 2, 356--385 (2023; Zbl 1515.90086) Full Text: DOI
Subramanyam, Anirudh A Lagrangian dual method for two-stage robust optimization with binary uncertainties. (English) Zbl 1499.90269 Optim. Eng. 23, No. 4, 1831-1871 (2022). MSC: 90C47 PDFBibTeX XMLCite \textit{A. Subramanyam}, Optim. Eng. 23, No. 4, 1831--1871 (2022; Zbl 1499.90269) Full Text: DOI arXiv
Gudapati, Naga V. C.; Malaguti, Enrico; Monaci, Michele Network design with service requirements: scaling-up the size of solvable problems. (English) Zbl 07625890 INFORMS J. Comput. 34, No. 5, 2571-2582 (2022). MSC: 90Cxx PDFBibTeX XMLCite \textit{N. V. C. Gudapati} et al., INFORMS J. Comput. 34, No. 5, 2571--2582 (2022; Zbl 07625890) Full Text: DOI arXiv
Fluschnik, Till; Kellerhals, Leon Placing Green bridges optimally, with a multivariate analysis. (English) Zbl 07495169 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 204-216 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Fluschnik} and \textit{L. Kellerhals}, Lect. Notes Comput. Sci. 12813, 204--216 (2021; Zbl 07495169) Full Text: DOI arXiv
Kerivin, Hervé; Wagler, Annegret On superperfection of edge intersection graphs of paths. (English) Zbl 1479.05311 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 79-91 (2021). MSC: 05C76 05C15 05C90 05C82 PDFBibTeX XMLCite \textit{H. Kerivin} and \textit{A. Wagler}, AIRO Springer Ser. 5, 79--91 (2021; Zbl 1479.05311) Full Text: DOI Link
Casazza, Marco; Ceselli, Alberto Optimization algorithms for resilient path selection in networks. (English) Zbl 1510.90066 Comput. Oper. Res. 128, Article ID 105191, 13 p. (2021). MSC: 90B18 90B10 90B25 90B80 PDFBibTeX XMLCite \textit{M. Casazza} and \textit{A. Ceselli}, Comput. Oper. Res. 128, Article ID 105191, 13 p. (2021; Zbl 1510.90066) Full Text: DOI Link
Ras, C. J.; Brazil, M.; Thomas, D. A. Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane. (English) Zbl 1464.68296 Theor. Comput. Sci. 850, 168-184 (2021). MSC: 68R10 68Q17 68U05 PDFBibTeX XMLCite \textit{C. J. Ras} et al., Theor. Comput. Sci. 850, 168--184 (2021; Zbl 1464.68296) Full Text: DOI
Arslan, Okan; Jabali, Ola; Laporte, Gilbert A flexible, natural formulation for the network design problem with vulnerability constraints. (English) Zbl 1451.90024 INFORMS J. Comput. 32, No. 1, 120-134 (2020). MSC: 90B10 05C82 90C35 90C57 PDFBibTeX XMLCite \textit{O. Arslan} et al., INFORMS J. Comput. 32, No. 1, 120--134 (2020; Zbl 1451.90024) Full Text: DOI
Ma, Juan; Balasundaram, Balabhaskar On the chance-constrained minimum spanning \(k\)-core problem. (English) Zbl 1428.90172 J. Glob. Optim. 74, No. 4, 783-801 (2019). MSC: 90C35 PDFBibTeX XMLCite \textit{J. Ma} and \textit{B. Balasundaram}, J. Glob. Optim. 74, No. 4, 783--801 (2019; Zbl 1428.90172) Full Text: DOI
Zetina, Carlos Armando; Contreras, Ivan; Fernández, Elena; Luna-Mota, Carlos Solving the optimum communication spanning tree problem. (English) Zbl 1403.90214 Eur. J. Oper. Res. 273, No. 1, 108-117 (2019). MSC: 90B10 90C35 90B18 90C57 PDFBibTeX XMLCite \textit{C. A. Zetina} et al., Eur. J. Oper. Res. 273, No. 1, 108--117 (2019; Zbl 1403.90214) Full Text: DOI Link
Chitnis, Rajesh; Feldmann, Andreas Emil; Manurangsi, Pasin Parameterized approximation algorithms for bidirected Steiner network problems. (English) Zbl 1522.68395 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 20, 16 p. (2018). MSC: 68R10 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{R. Chitnis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 20, 16 p. (2018; Zbl 1522.68395) Full Text: DOI arXiv
Gouveia, Luís; Joyce-Moniz, Martim; Leitner, Markus Branch-and-cut methods for the network design problem with vulnerability constraints. (English) Zbl 1391.90147 Comput. Oper. Res. 91, 190-208 (2018). MSC: 90B18 90C10 90C57 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Comput. Oper. Res. 91, 190--208 (2018; Zbl 1391.90147) Full Text: DOI
Bentz, Cédric; Costa, Marie-Christine; Poirion, Pierre-Louis; Ridremont, Thomas Formulations for designing robust networks. An application to wind power collection. (English) Zbl 1392.90021 Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 365-374 (2018). MSC: 90B10 90C35 90C11 91B76 PDFBibTeX XMLCite \textit{C. Bentz} et al., Electron. Notes Discrete Math. 64, 365--374 (2018; Zbl 1392.90021) Full Text: DOI arXiv
Diarrassouba, Ibrahima; Labidi, Mohamed Khalil; Mahjoub, Ali Ridha A hybrid optimization approach for the Steiner \(k\)-connected network design problem. (English) Zbl 1392.90042 Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 305-314 (2018). MSC: 90B18 90B25 90C10 90C59 PDFBibTeX XMLCite \textit{I. Diarrassouba} et al., Electron. Notes Discrete Math. 64, 305--314 (2018; Zbl 1392.90042) Full Text: DOI
Baffier, Jean-François; Poirion, Pierre-Louis; Suppakitpaisarn, Vorapong Bilevel model for adaptive network flow problem. (English) Zbl 1392.90020 Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 105-114 (2018). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{J.-F. Baffier} et al., Electron. Notes Discrete Math. 64, 105--114 (2018; Zbl 1392.90020) Full Text: DOI
Ferreira, Graciela; Nesmachnow, Sergio; Robledo, Franco A formulation for a hop constrained survivable network design problem. (English) Zbl 1474.90082 Yugosl. J. Oper. Res. 27, No. 4, 427-438 (2017). MSC: 90B10 90C05 90C10 PDFBibTeX XMLCite \textit{G. Ferreira} et al., Yugosl. J. Oper. Res. 27, No. 4, 427--438 (2017; Zbl 1474.90082) Full Text: DOI
Ljubić, Ivana; Mutzel, Petra; Zey, Bernd Stochastic survivable network design problems: theory and practice. (English) Zbl 1394.90450 Eur. J. Oper. Res. 256, No. 2, 333-348 (2017). MSC: 90C15 90C11 90C57 90B10 90C27 PDFBibTeX XMLCite \textit{I. Ljubić} et al., Eur. J. Oper. Res. 256, No. 2, 333--348 (2017; Zbl 1394.90450) Full Text: DOI
Gouveia, Luis; Leitner, Markus Design of survivable networks with vulnerability constraints. (English) Zbl 1380.90072 Eur. J. Oper. Res. 258, No. 1, 89-103 (2017). MSC: 90B10 90B18 90C10 PDFBibTeX XMLCite \textit{L. Gouveia} and \textit{M. Leitner}, Eur. J. Oper. Res. 258, No. 1, 89--103 (2017; Zbl 1380.90072) Full Text: DOI
Engel, Konrad; Kalinowski, Thomas; Savelsbergh, Martin W. P. Incremental network design with minimum spanning trees. (English) Zbl 1358.05262 J. Graph Algorithms Appl. 21, No. 4, 417-432 (2017). MSC: 05C82 05C05 05C22 PDFBibTeX XMLCite \textit{K. Engel} et al., J. Graph Algorithms Appl. 21, No. 4, 417--432 (2017; Zbl 1358.05262) Full Text: DOI arXiv
Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth A metaheuristic for security budget allocation in utility networks. (English) Zbl 1358.90020 Int. Trans. Oper. Res. 24, No. 1-2, 229-249 (2017). MSC: 90B10 90C35 90C59 PDFBibTeX XMLCite \textit{J. Janssens} et al., Int. Trans. Oper. Res. 24, No. 1--2, 229--249 (2017; Zbl 1358.90020) Full Text: DOI Link
Bravard, Christophe; Charroin, Liza; Touati, Corinne Optimal design and defense of networks under link attacks. (English) Zbl 1395.91369 J. Math. Econ. 68, 62-79 (2017). MSC: 91D30 91A43 90B10 PDFBibTeX XMLCite \textit{C. Bravard} et al., J. Math. Econ. 68, 62--79 (2017; Zbl 1395.91369) Full Text: DOI HAL
Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande A branch-and-cut algorithm for two-level survivable network design problems. (English) Zbl 1349.90171 Comput. Oper. Res. 67, 102-112 (2016). MSC: 90B10 90B25 90C11 90C59 PDFBibTeX XMLCite \textit{I. Rodríguez-Martín} et al., Comput. Oper. Res. 67, 102--112 (2016; Zbl 1349.90171) Full Text: DOI Link
Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande Hierarchical survivable network design problems. (English) Zbl 1351.90068 Pióro, Michał (ed.) et al., Proceedings of the 7th international network optimization conference (INOC), Warsaw, Poland, May 18–20, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 52, 229-236, electronic only (2016). MSC: 90B18 90C35 90C57 90C11 PDFBibTeX XMLCite \textit{I. Rodríguez-Martín} et al., Electron. Notes Discrete Math. 52, 229--236 (2016; Zbl 1351.90068) Full Text: DOI Link
Addis, Bernardetta; Carello, Giuliana; Mattia, Sara Energy-aware survivable networks. (English) Zbl 1351.90034 Pióro, Michał (ed.) et al., Proceedings of the 7th international network optimization conference (INOC), Warsaw, Poland, May 18–20, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 52, 133-140, electronic only (2016). MSC: 90B10 90C35 90C57 PDFBibTeX XMLCite \textit{B. Addis} et al., Electron. Notes Discrete Math. 52, 133--140 (2016; Zbl 1351.90034) Full Text: DOI
Leitner, Markus Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems. (English) Zbl 1353.90168 Comput. Optim. Appl. 65, No. 1, 73-92 (2016). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{M. Leitner}, Comput. Optim. Appl. 65, No. 1, 73--92 (2016; Zbl 1353.90168) Full Text: DOI
Hill, Alessandro; Voß, Stefan Optimal capacitated ring trees. (English) Zbl 1342.90111 EURO J. Comput. Optim. 4, No. 2, 137-166 (2016). MSC: 90C11 90C27 90C90 PDFBibTeX XMLCite \textit{A. Hill} and \textit{S. Voß}, EURO J. Comput. Optim. 4, No. 2, 137--166 (2016; Zbl 1342.90111) Full Text: DOI Link
Botton, Quentin; Fortz, Bernard; Gouveia, Luis On the hop-constrained survivable network design problem with reliable edges. (English) Zbl 1349.90158 Comput. Oper. Res. 64, 159-167 (2015). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{Q. Botton} et al., Comput. Oper. Res. 64, 159--167 (2015; Zbl 1349.90158) Full Text: DOI
Sharifiv, Firdovsi; Kutucu, Hakan A network design problem with two-edge matching failures. (English) Zbl 1328.90020 RAIRO, Oper. Res. 49, No. 2, 297-312 (2015). MSC: 90B10 05C70 90C11 90C35 90C59 PDFBibTeX XMLCite \textit{F. Sharifiv} and \textit{H. Kutucu}, RAIRO, Oper. Res. 49, No. 2, 297--312 (2015; Zbl 1328.90020) Full Text: DOI
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana The two-level diameter constrained spanning tree problem. (English) Zbl 1309.90065 Math. Program. 150, No. 1 (B), 49-78 (2015). MSC: 90C11 90C27 90C57 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Math. Program. 150, No. 1 (B), 49--78 (2015; Zbl 1309.90065) Full Text: DOI
Karaşan, Oya Ekin; Ridha Mahjoub, A.; Özkök, Onur; Yaman, Hande Survivability in hierarchical telecommunications networks under dual homing. (English) Zbl 1356.90033 INFORMS J. Comput. 26, No. 1, 1-15 (2014). MSC: 90B18 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{O. E. Karaşan} et al., INFORMS J. Comput. 26, No. 1, 1--15 (2014; Zbl 1356.90033) Full Text: DOI Link
Álvarez-Miranda, Eduardo; Cacchiani, Valentina; Lodi, Andrea; Parriani, Tiziano; Schmidt, Daniel R. Single-commodity robust network design problem: complexity, instances and heuristic solutions. (English) Zbl 1338.90073 Eur. J. Oper. Res. 238, No. 3, 711-723 (2014). MSC: 90B10 90C59 90C11 90C60 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} et al., Eur. J. Oper. Res. 238, No. 3, 711--723 (2014; Zbl 1338.90073) Full Text: DOI Link
Baxter, Matthew; Elgindy, Tarek; Ernst, Andreas T.; Kalinowski, Thomas; Savelsbergh, Martin W. P. Incremental network design with shortest paths. (English) Zbl 1338.90074 Eur. J. Oper. Res. 238, No. 3, 675-684 (2014). MSC: 90B10 90C10 90C35 90C59 PDFBibTeX XMLCite \textit{M. Baxter} et al., Eur. J. Oper. Res. 238, No. 3, 675--684 (2014; Zbl 1338.90074) Full Text: DOI
Du, Lili; Peeta, Srinivas A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions. (English) Zbl 1332.90055 Netw. Spat. Econ. 14, No. 2, 271-295 (2014). MSC: 90B15 90C15 PDFBibTeX XMLCite \textit{L. Du} and \textit{S. Peeta}, Netw. Spat. Econ. 14, No. 2, 271--295 (2014; Zbl 1332.90055) Full Text: DOI
Salles da Cunha, Alexandre; Sumika Hojo de Souza, Fernanda Finding totally independent spanning trees with linear integer programming. (English) Zbl 1452.90277 Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 149-160 (2014). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Salles da Cunha} and \textit{F. Sumika Hojo de Souza}, Lect. Notes Comput. Sci. 8596, 149--160 (2014; Zbl 1452.90277) Full Text: DOI
Ben-Ameur, W.; Pióro, M.; Żotkiewicz, M. Fractional routing using pairs of failure-disjoint paths. (English) Zbl 1326.90011 Discrete Appl. Math. 164, Part 1, 47-60 (2014). MSC: 90B15 90B25 90C35 PDFBibTeX XMLCite \textit{W. Ben-Ameur} et al., Discrete Appl. Math. 164, Part 1, 47--60 (2014; Zbl 1326.90011) Full Text: DOI
Puerto, Justo; Ricca, Federica; Scozzari, Andrea Reliability problems in multiple path-shaped facility location on networks. (English) Zbl 1308.90091 Discrete Optim. 12, 61-72 (2014). MSC: 90B80 90B10 90B25 PDFBibTeX XMLCite \textit{J. Puerto} et al., Discrete Optim. 12, 61--72 (2014; Zbl 1308.90091) Full Text: DOI
Puerto, Justo; Ricca, Federica; Scozzari, Andrea Unreliable point facility location problems on networks. (English) Zbl 1283.05258 Discrete Appl. Math. 166, 188-203 (2014). MSC: 05C85 05C50 68Q17 90B80 90C35 PDFBibTeX XMLCite \textit{J. Puerto} et al., Discrete Appl. Math. 166, 188--203 (2014; Zbl 1283.05258) Full Text: DOI
André, Jean; Auray, Stéphane; Brac, Jean; De Wolf, Daniel; Maisonnier, Guy; Ould-Sidi, Mohamed-Mahmoud; Simonnet, Antoine Design and dimensioning of hydrogen transmission pipeline networks. (English) Zbl 1317.90171 Eur. J. Oper. Res. 229, No. 1, 239-251 (2013). MSC: 90B90 PDFBibTeX XMLCite \textit{J. André} et al., Eur. J. Oper. Res. 229, No. 1, 239--251 (2013; Zbl 1317.90171) Full Text: DOI Link
Dziubiński, Marcin; Goyal, Sanjeev Network design and defence. (English) Zbl 1281.91044 Games Econ. Behav. 79, 30-43 (2013). MSC: 91A40 91A43 90B10 91A05 05C82 PDFBibTeX XMLCite \textit{M. Dziubiński} and \textit{S. Goyal}, Games Econ. Behav. 79, 30--43 (2013; Zbl 1281.91044) Full Text: DOI Link
Ben-Ameur, Walid; Hadji, Makhlouf; Ouorou, Adam Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. (English) Zbl 1269.90087 Networks 61, No. 4, 335-355 (2013). MSC: 90C27 05C90 05B35 PDFBibTeX XMLCite \textit{W. Ben-Ameur} et al., Networks 61, No. 4, 335--355 (2013; Zbl 1269.90087) Full Text: DOI
Mahjoub, A. Ridha; Simonetti, Luidi; Uchoa, Eduardo Hop-level flow formulation for the survivable network design with hop constraints problem. (English) Zbl 1269.90023 Networks 61, No. 2, 171-179 (2013). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{A. R. Mahjoub} et al., Networks 61, No. 2, 171--179 (2013; Zbl 1269.90023) Full Text: DOI
Carroll, Paula; McGarraghy, Seán A decomposition algorithm for the ring spur assignment problem. (English) Zbl 1263.90036 Int. Trans. Oper. Res. 20, No. 1, 119-139 (2013). MSC: 90B80 90C10 PDFBibTeX XMLCite \textit{P. Carroll} and \textit{S. McGarraghy}, Int. Trans. Oper. Res. 20, No. 1, 119--139 (2013; Zbl 1263.90036) Full Text: DOI Link
Shen, Siqian; Smith, J. Cole; Goli, Roshan Exact interdiction models and algorithms for disconnecting networks via node deletions. (English) Zbl 1254.90280 Discrete Optim. 9, No. 3, 172-188 (2012). MSC: 90C35 90C11 PDFBibTeX XMLCite \textit{S. Shen} et al., Discrete Optim. 9, No. 3, 172--188 (2012; Zbl 1254.90280) Full Text: DOI
Shen, Siqian; Smith, J. Cole Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English) Zbl 1251.90376 Networks 60, No. 2, 103-119 (2012). MSC: 90C35 05C85 68R10 90C39 PDFBibTeX XMLCite \textit{S. Shen} and \textit{J. C. Smith}, Networks 60, No. 2, 103--119 (2012; Zbl 1251.90376) Full Text: DOI
Mattia, Sara Solving survivable two-layer network design problems by metric inequalities. (English) Zbl 1244.90235 Comput. Optim. Appl. 51, No. 2, 809-834 (2012). MSC: 90C35 90C57 PDFBibTeX XMLCite \textit{S. Mattia}, Comput. Optim. Appl. 51, No. 2, 809--834 (2012; Zbl 1244.90235) Full Text: DOI Link
Fouilhoux, Pierre; Karasan, Oya Ekin; Mahjoub, A. Ridha; Özkök, Onur; Yaman, Hande Survivability in hierarchical telecommunications networks. (English) Zbl 1241.90023 Networks 59, No. 1, 37-58 (2012). MSC: 90B18 90C05 PDFBibTeX XMLCite \textit{P. Fouilhoux} et al., Networks 59, No. 1, 37--58 (2012; Zbl 1241.90023) Full Text: DOI Link
Akgün, İbrahim; Tansel, Barbaros Ç. New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints. (English) Zbl 1252.90085 Eur. J. Oper. Res. 212, No. 2, 263-276 (2011). MSC: 90C35 90C10 PDFBibTeX XMLCite \textit{İ. Akgün} and \textit{B. Ç. Tansel}, Eur. J. Oper. Res. 212, No. 2, 263--276 (2011; Zbl 1252.90085) Full Text: DOI
Gouveia, Luis; Simonetti, Luidi; Uchoa, Eduardo Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. (English) Zbl 1218.90201 Math. Program. 128, No. 1-2 (A), 123-148 (2011). MSC: 90C35 90C11 90C27 90C57 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Math. Program. 128, No. 1--2 (A), 123--148 (2011; Zbl 1218.90201) Full Text: DOI
Akgün, İbrahim New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll’s tightened Miller-Tucker-Zemlin constraints. (English) Zbl 1231.90363 Comput. Oper. Res. 38, No. 1, 277-286 (2011). MSC: 90C35 05C85 05C90 PDFBibTeX XMLCite \textit{İ. Akgün}, Comput. Oper. Res. 38, No. 1, 277--286 (2011; Zbl 1231.90363) Full Text: DOI
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Mailfert, J. The \(k\) edge-disjoint 3-hop-constrained paths polytope. (English) Zbl 1241.90155 Discrete Optim. 7, No. 4, 222-233 (2010). MSC: 90C35 90C10 PDFBibTeX XMLCite \textit{F. Bendali} et al., Discrete Optim. 7, No. 4, 222--233 (2010; Zbl 1241.90155) Full Text: DOI
Leitner, Markus; Raidl, Günther R. Strong lower bounds for a survivable network design problem. (English) Zbl 1237.90173 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 295-302 (2010). MSC: 90C11 90C27 90C35 PDFBibTeX XMLCite \textit{M. Leitner} and \textit{G. R. Raidl}, Electron. Notes Discrete Math. 36, 295--302 (2010; Zbl 1237.90173) Full Text: DOI
Bang-Jensen, Jørgen; Chiarandini, Marco; Morling, Peter A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. (English) Zbl 1214.68259 Networks 55, No. 4, 299-325 (2010). MSC: 68R10 05C40 05C82 05C85 68T20 90B18 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Networks 55, No. 4, 299--325 (2010; Zbl 1214.68259) Full Text: DOI
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Biha, M. Didi; Mailfert, J. A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem. (English) Zbl 1207.05192 Networks 55, No. 1, 13-32 (2010). MSC: 05C85 05C82 90C35 PDFBibTeX XMLCite \textit{F. Bendali} et al., Networks 55, No. 1, 13--32 (2010; Zbl 1207.05192) Full Text: DOI
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice. (English) Zbl 1198.90335 Math. Program. 124, No. 1-2 (B), 413-439 (2010). MSC: 90C27 90C57 90C90 PDFBibTeX XMLCite \textit{M. Chimani} et al., Math. Program. 124, No. 1--2 (B), 413--439 (2010; Zbl 1198.90335) Full Text: DOI
Desai, Jitamitra; Sen, Suvrajeet A global optimization algorithm for reliable network design. (English) Zbl 1187.90071 Eur. J. Oper. Res. 200, No. 1, 1-8 (2010). MSC: 90B10 90C11 PDFBibTeX XMLCite \textit{J. Desai} and \textit{S. Sen}, Eur. J. Oper. Res. 200, No. 1, 1--8 (2010; Zbl 1187.90071) Full Text: DOI
Bendali, F.; Mailfert, J. Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron. (English) Zbl 1170.90502 J. Comb. Optim. 18, No. 1, 1-22 (2009). MSC: 90C35 PDFBibTeX XMLCite \textit{F. Bendali} and \textit{J. Mailfert}, J. Comb. Optim. 18, No. 1, 1--22 (2009; Zbl 1170.90502) Full Text: DOI
Mahjoub, A. Rhida; Pesneau, Pierre On the Steiner 2-edge connected subgraph polytope. (English) Zbl 1157.05049 RAIRO, Oper. Res. 42, No. 3, 259-283 (2008). MSC: 05C85 90C27 PDFBibTeX XMLCite \textit{A. R. Mahjoub} and \textit{P. Pesneau}, RAIRO, Oper. Res. 42, No. 3, 259--283 (2008; Zbl 1157.05049) Full Text: DOI EuDML Link
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra Strong formulations for 2-node-connected Steiner network problems. (English) Zbl 1168.90579 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 190-200 (2008). MSC: 90C27 90C10 90C35 PDFBibTeX XMLCite \textit{M. Chimani} et al., Lect. Notes Comput. Sci. 5165, 190--200 (2008; Zbl 1168.90579) Full Text: DOI
Arkin, Esther M.; Hassin, Refael The \(k\)-path tree matroid and its applications to survivable network design. (English) Zbl 1177.90049 Discrete Optim. 5, No. 2, 314-322 (2008). MSC: 90B10 PDFBibTeX XMLCite \textit{E. M. Arkin} and \textit{R. Hassin}, Discrete Optim. 5, No. 2, 314--322 (2008; Zbl 1177.90049) Full Text: DOI
Fortz, B.; Mahjoub, A. R.; McCormick, S. T.; Pesneau, P. Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. (English) Zbl 1085.90009 Math. Program. 105, No. 1 (A), 85-111 (2006). MSC: 90B10 90C27 90C57 PDFBibTeX XMLCite \textit{B. Fortz} et al., Math. Program. 105, No. 1 (A), 85--111 (2006; Zbl 1085.90009) Full Text: DOI
Fonlupt, Jean; Mahjoub, A. Ridha Critical extreme points of the 2-edge connected spanning subgraph polytope. (English) Zbl 1085.90008 Math. Program. 105, No. 2-3 (B), 289-310 (2006). MSC: 90B10 90C27 90C57 PDFBibTeX XMLCite \textit{J. Fonlupt} and \textit{A. R. Mahjoub}, Math. Program. 105, No. 2--3 (B), 289--310 (2006; Zbl 1085.90008) Full Text: DOI