{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:52:49Z","timestamp":1744217569620,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T00:00:00Z","timestamp":1516060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s12243-017-0622-3","type":"journal-article","created":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T01:34:57Z","timestamp":1516066497000},"page":"5-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut"],"prefix":"10.1007","volume":"73","author":[{"given":"Ibrahima","family":"Diarrassouba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9263-6863","authenticated-orcid":false,"given":"Meriem","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hande","family":"Yaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"622_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","volume":"147","author":"F Barahona","year":"1995","unstructured":"Barahona F, Mahjoub AR (1995) On two-connected subgraph polytopes. Discret Math 147:19\u201334","journal-title":"Discret Math"},{"key":"622_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.disopt.2010.05.001","volume":"7","author":"F Bendali","year":"2010","unstructured":"Bendali F, Diarrassouba I, Mahjoub AR, Mailfert J (2010) The k edge-disjoint 3-hop-constrained paths polytope. Discret Optim 7:222\u2013233","journal-title":"Discret Optim"},{"key":"622_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali F, Diarrassouba I, Didi Biha M, Mahjoub AR, Mailfert J (2010) A branch-and-cut algorithm for the k-edge-connected subgraph problem. Networks 55:13\u201332","journal-title":"Networks"},{"key":"622_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cor.2015.05.009","volume":"64","author":"Q Botton","year":"2015","unstructured":"Botton Q, Fortz B, Gouveia L (2015) On the hop-constrained survivable network design problem with reliable edges. Comput Oper Res 64:159\u2013167","journal-title":"Comput Oper Res"},{"key":"622_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J Comput 25:13\u201326","journal-title":"INFORMS J Comput"},{"issue":"1-2","key":"622_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10107-010-0375-5","volume":"124","author":"M Chimani","year":"2010","unstructured":"Chimani M, Kandyba M, Ljubic I, Mutzel P (2010) Orientation-based models for 0, 1, 2-survivable network design: theory and practice. Math Program 124(1-2):413\u2013439","journal-title":"Math Program"},{"key":"622_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6377(99)00025-5","volume":"25","author":"G Dahl","year":"1999","unstructured":"Dahl G (1999) Notes on polyhedra associated with hop-constrained paths. Oper Res Lett 25:97\u2013100","journal-title":"Oper Res Lett"},{"key":"622_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.orl.2003.10.008","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl G, Foldnes N, Gouveia L (2004) A note on hop-constrained walk polytopes. Oper Res Lett 32:345\u2013349","journal-title":"Oper Res Lett"},{"key":"622_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl G, Gouveia L (2004) On the directed hop-constrained shortest path problem. Oper Res Lett 32:15\u201322","journal-title":"Oper Res Lett"},{"key":"622_CR10","unstructured":"IBM, IBM ILOG CPLEX Optimization studio 12.5 documentation (2013). Available at: \n                    http:\/\/www-01.ibm.com\/support\/knowledgecenter\/SSSA5p_12.5.1\/maps\/ic-homepage.html"},{"key":"622_CR11","unstructured":"Diarrassouba I (2009) Survivable network design problems with high connectivity requirements, PhD Thesis, Universit\u00e9 Blaise Pascal, France"},{"key":"622_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1002\/net.21679","volume":"67","author":"I Diarrassouba","year":"2016","unstructured":"Diarrassouba I, Kutucu H, Mahjoub AR (2016) Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67:316\u2013337","journal-title":"Networks"},{"key":"622_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/net.21667","volume":"67","author":"I Diarrassouba","year":"2016","unstructured":"Diarrassouba I, Gabrel V, Mahjoub AR, Gouveia L, Pesneau P (2016) Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67:148\u2013169","journal-title":"Networks"},{"key":"622_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.laa.2003.11.007","volume":"381","author":"M Didi Biha","year":"2004","unstructured":"Didi Biha M, Mahjoub AR (2004) The k-edge connected subgraph problem I: polytopes and critical extreme points. Linear Algebra Appl 381:117\u2013139","journal-title":"Linear Algebra Appl"},{"key":"622_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0167-6377(96)00015-6","volume":"19","author":"M Didi Biha","year":"1996","unstructured":"Didi Biha M, Mahjoub AR (1996) K-edge connected polyhedra on series-parallel graphs. Oper Res Lett 19:71\u201378","journal-title":"Oper Res Lett"},{"key":"622_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19:248\u2013264","journal-title":"J ACM"},{"key":"622_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. JSoc Ind Appl Math 9:551\u2013570","journal-title":"JSoc Ind Appl Math"},{"issue":"1","key":"622_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2016.09.003","volume":"258","author":"Luis Gouveia","year":"2017","unstructured":"Gouveia Luis, Leitner Markus (2017) Design of survivable networks with vulnerability constraints. Eur J Oper Res 258(1):89\u2013103","journal-title":"Eur J Oper Res"},{"key":"622_CR19","first-page":"167","volume":"33","author":"L Gouveia","year":"2005","unstructured":"Gouveia L, Patricio P, de Sousa A (2005) Compact models for hop-constrained node survivable network design, an application to MPLS, telecommunications planning: innovations in pricing, network design and management. Springer 33:167\u2013180","journal-title":"Springer"},{"key":"622_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1090\/dimacs\/005\/08","volume":"5","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, Monma CL, Stoer M (1991) Polyhedral approaches to network survivability. Series in Discrete Mathematics & Theoretical Computer Science 5:121\u2013141","journal-title":"Series in Discrete Mathematics & Theoretical Computer Science"},{"key":"622_CR21","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M, Monma CL (1990) Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J Discret Math 3:502\u2013523","journal-title":"SIAM J Discret Math"},{"key":"622_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel M, Monma CL, Stoer M (1992) Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper Res 40:309\u2013330","journal-title":"Oper Res"},{"key":"622_CR23","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1287\/opre.43.6.1012","volume":"43","author":"M Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel M, Monma CL, Stoer M (1995) Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper Res 43:1012\u20131024","journal-title":"Oper Res"},{"key":"622_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.20147","volume":"49","author":"D Huygens","year":"2007","unstructured":"Huygens D, Mahjoub AR (2007) Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49:135\u2013144","journal-title":"Networks"},{"key":"622_CR25","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D Huygens","year":"2007","unstructured":"Huygens D, Labb\u00e9 M., Mahjoub AR, Pesneau P (2007) The two-edge connected hop-constrained network design problem: valid inequalities and branch-and-cut. Networks 49:116\u2013133","journal-title":"Networks"},{"key":"622_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D Huygens","year":"2004","unstructured":"Huygens D, Mahjoub AR, Pesneau P (2004) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J Disc Math 18:287\u2013312","journal-title":"SIAM J Disc Math"},{"key":"622_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2015","unstructured":"Kerivin H, Mahjoub AR (2015) Design of survivable networks: a survey. Networks 46:1\u201321","journal-title":"Networks"},{"key":"622_CR28","unstructured":"Kerivin H, Mahjoub AR, Nocq C (2004) (1,2)-survivable networks: facets and branch and cut, The sharpest cut. In: Gr\u00f6tschel M (ed) MPS\/SIAM optimization, pp 121\u2013152"},{"key":"622_CR29","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.cie.2017.03.007","volume":"112","author":"M Mahjoub","year":"2017","unstructured":"Mahjoub M, Diarrassouba I, Mahjoub AR, Taktak R (2017) The survivable k-node-connected network design problem: valid inequalities and Branch-and-Cut. Comput Ind Eng 112:690\u2013 705","journal-title":"Comput Ind Eng"},{"key":"622_CR30","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"AR Mahjoub","year":"1994","unstructured":"Mahjoub AR (1994) Two-edge connected spanning subgraphs and polyhedra. Math Program 64:199\u2013208","journal-title":"Math Program"},{"issue":"1\u20133","key":"622_CR31","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0166-218X(99)00088-8","volume":"95","author":"AR Mahjoub","year":"1999","unstructured":"Mahjoub AR, Nocq C (1999) On the linear relaxation of the 2-node connected subgraph polytope. Discret Appl Math 95(1\u20133):389\u2013416","journal-title":"Discret Appl Math"},{"key":"622_CR32","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-21527-8_23","volume":"6701","author":"AR Mahjoub","year":"2011","unstructured":"Mahjoub AR, Simonetti L, Uchoa E (2011) Hop-level flow formulation for the hop constrained survivable network design problem. Lect Notes Comput Sci 6701:176\u2013181","journal-title":"Lect Notes Comput Sci"},{"key":"622_CR33","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger K (1927) Zur allgemeinen kurventhorie. Fundamanta Mathematicae 10:96\u2013115","journal-title":"Fundamanta Mathematicae"},{"key":"622_CR34","unstructured":"TSPLIB (1991). Available at: \n                    http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-017-0622-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T19:37:18Z","timestamp":1547581038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-017-0622-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,16]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s12243-017-0622-3","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2018,1,16]]},"assertion":[{"value":"19 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}