{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T20:45:55Z","timestamp":1696884355752},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,15]],"date-time":"2007-12-15T00:00:00Z","timestamp":1197676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Netw Spat Econ"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11067-007-9038-3","type":"journal-article","created":{"date-parts":[[2007,12,14]],"date-time":"2007-12-14T05:02:12Z","timestamp":1197608532000},"page":"3-21","source":"Crossref","is-referenced-by-count":30,"title":["Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM"],"prefix":"10.1007","volume":"8","author":[{"given":"Lu\u00eds","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Patr\u00edcio","sequence":"additional","affiliation":[]},{"given":"Amaro","family":"de Sousa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,15]]},"reference":[{"issue":"1","key":"9038_CR1","first-page":"92","volume":"4","author":"A Balakrishnan","year":"1992","unstructured":"Balakrishnan A, Altinkemer K (1992) Using a hop-constrained model to generate alternative communication network design. ORSA J Comput 4(1):92\u2013205","journal-title":"ORSA J Comput"},{"key":"9038_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1002\/net.10100","volume":"43","author":"A Balakrishnan","year":"2004","unstructured":"Balakrishnan A, Magnanti TL, Mirchandani P (2004) Connectivity-splitting models for survivable network design. Networks 43:10\u201327","journal-title":"Networks"},{"issue":"1","key":"9038_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-006-0047-2","volume":"146","author":"S Borne","year":"2006","unstructured":"Borne S, Gourdin E, Liau B, Mahjoub AR (2006) Design of survivable IP-over-optical networks. Ann Oper Res 146(1):41\u201373","journal-title":"Ann Oper Res"},{"key":"9038_CR4","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"},{"key":"9038_CR5","doi-asserted-by":"crossref","unstructured":"Gouveia L, Patr\u00edcio P, de Sousa A, Valadas R (2003) MPLS over WDM network design with packet level QoS constraints based on ILP models. In: Proc of IEEE INFOCOM, San Francisco, April, 2003","DOI":"10.1109\/INFCOM.2003.1208708"},{"key":"9038_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/0-387-29234-9_9","volume-title":"Telecommunications network planning: innovations in pricing, network design and management","author":"L Gouveia","year":"2006","unstructured":"Gouveia L, Patr\u00edcio PF, Sousa AF (2006) Compact models for hop-constrained node survivable network design. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 167\u2013180"},{"issue":"2","key":"9038_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D Huygens","year":"2005","unstructured":"Huygens D, Mahjoub AR, Pesneau P (2005) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J Discrete Math 18(2):287\u2013312","journal-title":"SIAM J Discrete Math"},{"key":"9038_CR8","unstructured":"Huygens D, Labb\u00e9 M, Mahjoub AR, Pesneau, P (2004) Two edge-disjoint hop-constrained paths: valid inequalities and branch-and-cut. Paper presented at Optimization 2004, Lisbon, 2004"},{"issue":"1","key":"9038_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10922-005-1855-4","volume":"13","author":"A Koster","year":"2005","unstructured":"Koster A, Zymolka A, Jager M, Hulsermann R (2005) Demand-wise shared protection for meshed optical networks. J Netw Syst Manag 13(1):35\u201355","journal-title":"J Netw Syst Manag"},{"key":"9038_CR10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/ijoc.11.2.188","volume":"11","author":"L LeBlanc","year":"1999","unstructured":"LeBlanc L, Chifflet J, Mahey P (1999) Packet routing in telecommunication networks with path and flow restrictions. INFORMS J Comput 11:188\u2013197","journal-title":"INFORMS J Comput"},{"issue":"2","key":"9038_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"T Magnanti","year":"2005","unstructured":"Magnanti T, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61\u201379","journal-title":"Networks"},{"key":"9038_CR12","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"TL Magnanti","year":"1995","unstructured":"Magnanti TL, Mirchandani P, Vachani R (1995) Modeling and solving the two-facility capacitated network loading problem. Oper Res 43:142\u2013157","journal-title":"Oper Res"},{"key":"9038_CR13","doi-asserted-by":"crossref","unstructured":"Mannie E (2004) Generalized multi-protocol label switching (GMPLS) architecture. RFC 3945. Internet Engineering Task Force, Sterling","DOI":"10.17487\/rfc3945"},{"key":"9038_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/0-387-29234-9_8","volume-title":"Telecommunications network planning: innovations in pricing, network design and management","author":"S Orlowski","year":"2006","unstructured":"Orlowski S, Wessaely R (2006) The effect of hop limits on optimal cost in survivable network. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 151\u2013166"},{"key":"9038_CR15","volume-title":"Formulations and algorithms for network design problems with connectivity requirements. Ph.D thesis","author":"S Raghavan","year":"1995","unstructured":"Raghavan S (1995) Formulations and algorithms for network design problems with connectivity requirements. Ph.D thesis, MIT, Cambridge"},{"key":"9038_CR16","first-page":"335","volume-title":"Annotated bibliographies in combinatorial optimization","author":"S Raghavan","year":"1997","unstructured":"Raghavan S, Magnanti TL (1997) Network connectivity. In: Dell\u2019Amico M, Maffiolli F, Martello S, (eds.) Annotated bibliographies in combinatorial optimization. Wiley, New York, pp 335\u2013354"},{"key":"9038_CR17","volume-title":"Optical networks: a practical perspective","author":"R Ramaswami","year":"2002","unstructured":"Ramaswami R, Sivarajan KN (2002) Optical networks: a practical perspective, 2nd edn. Morgan-Kaufmann, San Mateo","edition":"2"},{"key":"9038_CR18","doi-asserted-by":"crossref","unstructured":"Sharma V, Hellstrand F (2003) Framework for multi-protocol label switching (MPLS)-based recovery. RFC 3469. Internet Engineering Task Force, Sterling","DOI":"10.17487\/rfc3469"},{"key":"9038_CR19","volume-title":"Design of survivable networks. Lecture notes in mathematics, No. 1531","author":"M Stoer","year":"1992","unstructured":"Stoer M (1992) Design of survivable networks. Lecture notes in mathematics, No. 1531, Springer, Berlin Heidelberg New York"}],"container-title":["Networks and Spatial Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11067-007-9038-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11067-007-9038-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11067-007-9038-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:40:22Z","timestamp":1559349622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11067-007-9038-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,15]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9038"],"URL":"https:\/\/doi.org\/10.1007\/s11067-007-9038-3","relation":{},"ISSN":["1566-113X","1572-9427"],"issn-type":[{"value":"1566-113X","type":"print"},{"value":"1572-9427","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,15]]}}}