On the Steiner 2-edge connected subgraph polytope
RAIRO-Oper. Res., 42 3 (2008) 259-283
Published online: 2008-08-20
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints
Raouia TaktakAnnals of Operations Research 351 (1) 993 (2025)
https://doi.org/10.1007/s10479-024-06003-7
Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints
Fatmah Almathkour, Ibrahima Diarrassouba and Youssouf HadhbiAnnals of Operations Research 351 (1) 965 (2025)
https://doi.org/10.1007/s10479-024-06123-0
The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra
A. Ridha Mahjoub, Raouia Taktak and Eduardo UchoaJournal of Combinatorial Optimization 49 (5) (2025)
https://doi.org/10.1007/s10878-025-01288-1
Design of survivable networks with low connectivity requirements
Fatmah Almathkour, Youcef Magnouche, A. Ridha Mahjoub and Raouia TaktakInternational Transactions in Operational Research 32 (2) 918 (2025)
https://doi.org/10.1111/itor.13511
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut
Intesar Almudahka, Ibrahima Diarrassouba, A. Ridha Mahjoub and Raouia TaktakComputers & Industrial Engineering 184 109585 (2023)
https://doi.org/10.1016/j.cie.2023.109585
1020 (2022)
https://doi.org/10.1109/CoDIT55151.2022.9803882
12176 66 (2020)
https://doi.org/10.1007/978-3-030-53262-8_6
A branch-and-cut algorithm for two-level survivable network design problems
Inmaculada Rodríguez-Martín, Juan-José Salazar-González and Hande YamanComputers & Operations Research 67 102 (2016)
https://doi.org/10.1016/j.cor.2015.09.008
The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm
Inmaculada Rodríguez‐Martín, Juan‐José Salazar‐González and Hande YamanNetworks 68 (2) 130 (2016)
https://doi.org/10.1002/net.21687
Survivability in Hierarchical Telecommunications Networks Under Dual Homing
Oya Ekin Karaşan, A. Ridha Mahjoub, Onur Özkök and Hande YamanINFORMS Journal on Computing 26 (1) 1 (2014)
https://doi.org/10.1287/ijoc.1120.0541
Control and Automation, and Energy System Engineering
Pablo Sartor and Franco RobledoCommunications in Computer and Information Science, Control and Automation, and Energy System Engineering 256 7 (2011)
https://doi.org/10.1007/978-3-642-26010-0_2