{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T04:01:44Z","timestamp":1741665704002,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_27","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"216-229","source":"Crossref","is-referenced-by-count":2,"title":["Lexicographical Minimization of Routing Hops in Telecommunication Networks"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Gouveia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Patr\u00edcio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaro","family":"de Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"6","author":"W. Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., Kerivin, H.: Routing of Uncertain Traffic Demands. Optim. Eng.\u00a06, 283\u2013313 (2005)","journal-title":"Optim. Eng."},{"key":"27_CR2","unstructured":"Botton, Q., Fortz. B., Gouveia, L., Poss, M.: Benders decomposition for the hop constrained survivable network design problem. CIO working paper (March 2010)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-0-387-30165-5_19","volume-title":"Handbook of Optimization in Telecommunications","author":"G. Dahl","year":"2006","unstructured":"Dahl, G., Gouveia, L., Requejo, C.: On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunications, pp. 493\u2013515. Springer, Heidelberg (2006)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L.: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. INFORMS J. Comput.\u00a010, 180\u2013188 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11067-007-9038-3","volume":"8","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Patr\u00edcio, P.F., de Sousa, A.F.: Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM. Netw. Spat. Econ.\u00a08(1), 3\u201321 (2008)","journal-title":"Netw. Spat. Econ."},{"key":"27_CR6","series-title":"Operations Research\/Computer Science Interfaces Book Series","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-0-387-77780-1_12","volume-title":"Telecommunications Modeling, Policy, and Technology","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Patr\u00edcio, P.F., de Sousa, A.F.: Optimal Survivable Routing with a Small Number of Hops. In: Raghavan, S., Golden, G., Wasil, E. (eds.) Telecommunications Modeling, Policy, and Technology. Operations Research\/Computer Science Interfaces Book Series, vol.\u00a044, pp. 253\u2013274. Springer, Heidelberg (2008)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Patr\u00edcio, P.F., de Sousa, A.F.: Models for Optimal Survivable Routing with a Minimum Number of Hops: Comparing Disaggregated with Aggregated Models. Int. Trans. Oper. Res. (2011), doi: 10.1111\/j.1475-3995.2010.00766.x","DOI":"10.1111\/j.1475-3995.2010.00766.x"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D. Huygens","year":"2007","unstructured":"Huygens, D., Labb, M., Mahjoub, A.R., Pesneau, P.: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Netw\u00a049(1), 116\u2013133 (2007)","journal-title":"Netw"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the QoS routing problem. In: Infocom Proc., vol.\u00a02, pp. 859\u2013868 (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H. Kerivin","year":"2005","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of Survivable Networks: A Survey. Netw.\u00a046(1), 1\u201321 (2005)","journal-title":"Netw."},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2008.080403","volume":"10","author":"D. Nace","year":"2008","unstructured":"Nace, D., Pi\u00f3ro, M.: Max-Min Fairness And Its Applications to Routing and Load-Balancing in Communication Networks: A Tutorial. IEEE Surv. and Tutor.\u00a010(4), 5\u201317 (2008)","journal-title":"IEEE Surv. and Tutor."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Ogryczak, W., Milewski, M., Wierzbicki, A.: Fair and Efficient Bandwidth Allocation with the Reference Point Methodology. In: INOC Proc. (2007)","DOI":"10.26636\/jtit.2006.4.398"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/90.779205","volume":"7","author":"A. Orda","year":"1999","unstructured":"Orda, A.: Routing with end to end QoS guarantees in broadband networks. IEEE\/ACM Trans. Netw.\u00a07(3), 365\u2013374 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"27_CR14","series-title":"Operations Research\/Computer Science Interfaces Book Series","doi-asserted-by":"publisher","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.: The Effect of Hop Limits on Optimal Cost in Survivable Network Design. In: Raghavan, S., Anandalingam, G. (eds.) Telecommunications Network Planning: Innovations in Pricing, Network Design and Management. Operations Research\/Computer Science Interfaces Book Series, vol.\u00a033, pp. 151\u2013166. Springer, Heidelberg (2006)"},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/90.298432","volume":"2","author":"A. Parekh","year":"1994","unstructured":"Parekh, A., Gallager, R.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. IEEE\/ACM Trans. Netw.\u00a02(2), 137\u2013150 (1994)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"B. Radunovic","year":"2007","unstructured":"Radunovic, B., Le Boudec, J.-Y.: A Unified Framework for Max-min and Min-max Fairness with Applications. IEEE\/ACM Trans. Netw.\u00a015(5), 1073\u20131083 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Santos, D., de Sousa, A., Alvelos, F., Pi\u00f3ro, M.: Link Load Balancing Optimization of Telecommunication Networks: a Column Generation based Heuristic Approach. In: Int. Telecommun. In: Netw. Strategy Plan. Symp. Proc., pp. 1\u20136 (2010)","DOI":"10.1109\/NETWKS.2010.5624911"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/90.993305","volume":"10","author":"X. Yuan","year":"2002","unstructured":"Yuan, X.: Heuristic Algorithms for multiconstrained quality-of-service routing. IEEE\/ACM Trans. Netw.\u00a010(2), 244\u2013256 (2002)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T04:36:17Z","timestamp":1741581377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}