{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:07Z","timestamp":1725605527798},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_9","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:01:16Z","timestamp":1315465276000},"page":"71-76","source":"Crossref","is-referenced-by-count":1,"title":["The Two Level Network Design Problem with Secondary Hop Constraints"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gollowitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Gouveia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"9_CR1","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"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6377(99)00025-5","volume":"25","author":"G. Dahl","year":"1999","unstructured":"Dahl, G.: Notes on polyhedra associated with hop-constrained paths. Operations Research Letters\u00a025(2), 97\u2013100 (1999)","journal-title":"Operations Research Letters"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Gollowitzer, S., Gouveia, L., Ljubi\u0107, I.: A node splitting technique for two level network design problems with transition nodes. Tech. rep. (2011)","DOI":"10.1007\/978-3-642-21527-8_8"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/S0377-2217(97)00067-2","volume":"105","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L., Janssen, E.: Designing reliable tree networks with two cable technologies. European Journal of Operational Research\u00a0105(3), 552\u2013568 (1998)","journal-title":"European Journal of Operational Research"},{"key":"9_CR5","doi-asserted-by":"crossref","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, 1\u201326","DOI":"10.1007\/s10107-009-0297-2"},{"key":"9_CR6","unstructured":"Gouveia, L., Telhada, J.: Distance-constrained hierarchical networks. In: Proceedings of International Network Optimization Conference, INOC 2005, pp. B2.416\u2013B2.421 (2005)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/168173.168420","volume":"19","author":"B.N. Khoury","year":"1993","unstructured":"Khoury, B.N., Pardalos, P.M., Du, D.Z.: A test problem generator for the Steiner problem in graphs. ACM Trans. Math. Softw.\u00a019(4), 509\u2013522 (1993)","journal-title":"ACM Trans. Math. Softw."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ljubi\u0107, I., Gollowitzer, S.: Modeling the hop constrained connected facility location problem on layered graphs. In: Proceedings of the International Symposium on Combinatorial Optimization (ISCO). Electronic Notes in Discrete Mathematics, vol.\u00a036, pp. 207\u2013214 (2010)","DOI":"10.1016\/j.endm.2010.05.027"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:27:43Z","timestamp":1560558463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}