{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:00Z","timestamp":1740148920981,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002749","name":"Belgian Science Policy Office","doi-asserted-by":"crossref","award":["P7\/36 \u00abCOMEX\u00bb"],"award-info":[{"award-number":["P7\/36 \u00abCOMEX\u00bb"]}],"id":[{"id":"10.13039\/501100002749","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Funda\u00e7ao para a Ci\u00eancia e a Tecnologia (PT)","award":["UID\/MAT\/04561\/201"],"award-info":[{"award-number":["UID\/MAT\/04561\/201"]}]}],"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-0615-2","type":"journal-article","created":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T04:21:11Z","timestamp":1512706871000},"page":"29-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The 2 edge-disjoint 3-paths polyhedron"],"prefix":"10.1007","volume":"73","author":[{"given":"Quentin","family":"Botton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,8]]},"reference":[{"issue":"4","key":"615_CR1","doi-asserted-by":"crossref","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 edge-disjoint 3-hop-constrained paths polytope. Discret Optim 7(4):222\u2013233","journal-title":"Discret Optim"},{"issue":"3-4","key":"615_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s00037-003-0179-6","volume":"12","author":"A Bley","year":"2003","unstructured":"Bley A (2003) On the complexity of vertex-disjoint length-restricted path problems. Comput Complex 12(3-4):131\u2013149","journal-title":"Comput Complex"},{"key":"615_CR3","doi-asserted-by":"crossref","unstructured":"Bley A, Neto J (2010) Approximability of 3- and 4-hop bounded disjoint paths problems. In: Eisenbrand F, Shepherd FB (eds) Integer programming and combinatorial optimization (IPCO), lecture notes in computer science, vol 6080. Springer, pp 205\u2013218","DOI":"10.1007\/978-3-642-13036-6_16"},{"key":"615_CR4","unstructured":"Botton Q (2010) Survivable network design with quality of service constraints: extended formulations and Benders decomposition, Ph.D. Thesis, Facult\u00e9s des Sciences \u00c9conomiques, Sociales, Politiques et de Communication, Universit\u00e9 Catholique de Louvain"},{"issue":"1","key":"615_CR5","doi-asserted-by":"crossref","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(1):13\u201326","journal-title":"INFORMS J Comput"},{"issue":"4","key":"615_CR6","doi-asserted-by":"crossref","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(4):345\u2013349","journal-title":"Oper Res Lett"},{"key":"615_CR7","doi-asserted-by":"crossref","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"},{"issue":"5","key":"615_CR8","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/j.orl.2005.09.001","volume":"34","author":"G Dahl","year":"2006","unstructured":"Dahl G, Huygens D, Mahjoub AR, Pesneau P (2006) On the k edge-disjoint 2-hop-constrained paths polytope. Oper Res Lett 34(5):577\u2013582","journal-title":"Oper Res Lett"},{"key":"615_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L Gouveia","year":"1998","unstructured":"Gouveia L (1998) Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J Comput 10:180\u2013188","journal-title":"INFORMS J Comput"},{"issue":"2","key":"615_CR10","doi-asserted-by":"crossref","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 Discrete Math 18(2):287\u2013312","journal-title":"SIAM J Discrete Math"},{"key":"615_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"2","author":"A Ita\u00ed","year":"1982","unstructured":"Ita\u00ed A, Perl Y, Shiloach Y (1982) The complexity of finding maximum disjoint paths with length constraints. Networks 2:277\u2013286","journal-title":"Networks"},{"issue":"2","key":"615_CR12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/S089548019630978X","volume":"12","author":"J Janssen","year":"1999","unstructured":"Janssen J, Kilakos K (1999) Bounded stable sets: polytopes and colorings. SIAM J Discrete Math 12(2):262\u2013275","journal-title":"SIAM J Discrete Math"},{"key":"615_CR13","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer programming. Wiley, New York"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-017-0615-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0615-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0615-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T22:37:49Z","timestamp":1517870269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-017-0615-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,8]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s12243-017-0615-2","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2017,12,8]]}}}