{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:33Z","timestamp":1725458073674},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_19","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"201-212","source":"Crossref","is-referenced-by-count":1,"title":["On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes"],"prefix":"10.1007","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Markus","family":"Leitner","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: Solving constraint integer programs. Mathematical Programming Computation\u00a01(1), 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"Balakrishnan, A., Altinkemer, K.: Using a hop-constrained model to generate alternative communication network design. INFORMS Journal on Computing\u00a04(2), 192\u2013205 (1992)","journal-title":"INFORMS Journal on Computing"},{"issue":"7","key":"19_CR3","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science\u00a040(7), 846\u2013867 (1994)","journal-title":"Management Science"},{"key":"19_CR4","unstructured":"Beasley, J.E.: Collection of test data sets for a variety of operations research (OR) problems (1990), \n                    \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"19_CR5","unstructured":"Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS Journal on Computing (2011) (to appear)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Dahl, G., Gouveia, L., Requejo, C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 493\u2013515. Springer (2006)","DOI":"10.1007\/978-0-387-30165-5_19"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Frangioni, A., Gendron, B.: A stabilized structured Dantzig-Wolfe decomposition method. Mathematical Programming (to appear, 2012)","DOI":"10.1007\/s10107-012-0626-8"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L. Gouveia","year":"1996","unstructured":"Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research\u00a095(1), 178\u2013190 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.cor.2006.03.022","volume":"35","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Paias, A., Sharma, D.: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & Operations Research\u00a035(2), 600\u2013613 (2008)","journal-title":"Computers & Operations Research"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L. Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Mathematical Programming\u00a0128, 123\u2013148 (2011)","journal-title":"Mathematical Programming"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"3599","DOI":"10.1016\/j.cor.2007.03.003","volume":"35","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Telhada, J.: The multi-weighted Steiner tree problem: A reformulation by intersection. Computers & Operations Research\u00a035, 3599\u20133611 (2008)","journal-title":"Computers & Operations Research"},{"key":"19_CR12","unstructured":"Ljubi\u0107, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Vienna University of Technology (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:02Z","timestamp":1620129362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}