{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:03Z","timestamp":1725465543862},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387292229"},{"type":"electronic","value":"9780387292342"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/0-387-29234-9_9","type":"book-chapter","created":{"date-parts":[[2006,3,11]],"date-time":"2006-03-11T07:56:56Z","timestamp":1142063816000},"page":"167-180","source":"Crossref","is-referenced-by-count":6,"title":["Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS"],"prefix":"10.1007","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","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"Balakrishnan, A., and Altinkemer, K. (1992), \u201cUsing a Hop-constrained Model to Generate Alternative Communication Network Design\u201d, ORSA Journal on Computing, Vol 4, pp 192\u2013205.","journal-title":"ORSA Journal on Computing"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1002\/net.10100","volume":"43","author":"A. Balakrishnan","year":"2004","unstructured":"Balakrishnan, A., Magnanti, T.L., and Mirchandani, P., (2004), \u201cConnectivity-Splitting Models for Survivable Network Design\u201d, Networks, Vol 43, pp 10\u201327.","journal-title":"Networks"},{"key":"9_CR3","first-page":"17","volume":"36","author":"W. Ben-Ameur","year":"2000","unstructured":"Ben-Ameur, W. (2000), \u201cConstrained Length Connectivity and Survivable Networks\u201d, Vol 36, pp 17\u201333.","journal-title":"Constrained Length Connectivity and Survivable Networks"},{"key":"9_CR4","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. and Gouveia, L. (2004), \u201cOn the Directed Hop-Constrained Shortest Path Problem\u201d, O.R. Letters, Vol 32, pp 15\u201322.","journal-title":"O.R. Letters"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L. (1998), \u201cUsing Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints\u201d, INFORMS Journal on Computing, Vol. 10, pp 180\u2013188.","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR6","first-page":"576","volume":"1","author":"L. Gouveia","year":"2003","unstructured":"Gouveia, L., Patr\u00edcio, P., de Sousa, A.F. and Valadas, R. (2003), \u201cMPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models\u201d, IEEE INFOCOM, Vol. 1, pp. 576\u2013586.","journal-title":"IEEE INFOCOM"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Huygens, D., Mahjoub, A.R., and Pesneau, P. (2004), \u201cTwo Edge-Disjoint Hop-Constrained Paths and Polyhedra\u201d Research Report LIMOS\/RR 04-20 from LIMOS, Universit\u00c3\u00a9 Blaise Pascal, Clermont-Ferrand, France, (to appear in SIAM Journal on Discrete Math).","DOI":"10.1137\/S0895480102419445"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Huygens, D., Labb\u00e9, M., Mahjoub, A.R., and Pesneau, P. (2004), \u201cTwo Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut\u201d paper presented at Optimization 2004, Lisbon, July 1004.","DOI":"10.1137\/S0895480102419445"},{"key":"9_CR9","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., and Mahey, P. (1999), \u201cPacket Routing in Telecommunication Networks with Path and Flow Restrictions\u201d, INFORMS Journal on Computing, Vol. 11, pp 188\u2013197.","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR10","unstructured":"Magnanti, T. and Raghavan, S. (1999), \u201cStrong Formulations for Network Design Problems with Connectivity Requirements, Working paper OR 332-99, Operations Research Center, MIT, April 1999."},{"key":"9_CR11","unstructured":"Orlowski, S., and Wessaely, R. (2004), \u201cThe Effect of Hop Limits on Optimal Cost in Survivable Network\u201d, ZIB-Report 04-23 (June 2004)."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/90.298432","volume":"2","author":"A. Parekh","year":"1994","unstructured":"Parekh, A. and Gallager, R. (1994), \u201cA Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case\u201d, IEEE\/ACM Transactions on Networking, Vol. 2, No. 2, pp. 137\u2013150.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9_CR13","unstructured":"Raghavan, S., (1995), \u201cFormulations and Algorithms for Network Design Problems with Connectivity Requirements\u201d, PhD Thesis, MIT, Cambridge."},{"key":"9_CR14","unstructured":"Raghavan, S., and Magnanti, T. L., (1997), \u201cNetwork Connectivity\u201d, In M. Dell\u2019Amico, F. Maffiolli and S. Martello, Eds., Annotated Bibliographies in Combinatorial Optimization, pp 335\u2013354, John Wiley & Sons."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Stoer, M. (1992), \u201cDesign of Survivable Networks\u201d, Lecture Notes in Mathematics, No 1531, Springer Verlag.","DOI":"10.1007\/BFb0088963"},{"issue":"12","key":"9_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/35.809385","volume":"37","author":"G. Swallow","year":"1999","unstructured":"Swallow, G. (1999), \u201cMPLS Advantages for Traffic Engineering\u201d, IEEE Communications Magazine, Vol. 37, No. 12, pp. 54\u201357.","journal-title":"IEEE Communications Magazine"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/65.826369","volume":"14","author":"X. Xiao","year":"2000","unstructured":"Xiao, X., Hannan, A. and Bailey, B. (2000), \u201cTraffic Engineering with MPLS in the Intemef\u201d, IEEE Network, Vol. 14, No. 2, pp. 28\u201333.","journal-title":"IEEE Network"}],"container-title":["Operations Research\/Computer Science Interfaces Series","Telecommunications Planning: Innovations in Pricing, Network Design and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-29234-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T18:39:59Z","timestamp":1683398399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-29234-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387292229","9780387292342"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/0-387-29234-9_9","relation":{},"ISSN":["1387-666X"],"issn-type":[{"type":"print","value":"1387-666X"}],"subject":[],"published":{"date-parts":[[2006]]}}}