{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:18Z","timestamp":1725605538856},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_8","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:01:16Z","timestamp":1315465276000},"page":"57-70","source":"Crossref","is-referenced-by-count":5,"title":["A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gollowitzer","sequence":"first","affiliation":[]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: A dual-based algorithm for multi-level network design. Management Science\u00a040(5), 567\u2013581 (1994)","journal-title":"Management Science"},{"issue":"7","key":"8_CR2","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":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","volume":"4","author":"S. Chopra","year":"1992","unstructured":"Chopra, S., Gorres, E.R., Rao, M.R.: Solving the Steiner Tree Problem on a Graph Using Branch and Cut. INFORMS Journal on Computing\u00a04(3), 320\u2013335 (1992)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.omega.2010.01.005","volume":"39","author":"A.M. Costa","year":"2011","unstructured":"Costa, A.M., Fran\u00e7a, P.M., Lyra Filho, C.: Two-level network design with intermediate facilities: An application to electrical distribution systems. Omega\u00a039(1), 3\u201313 (2011)","journal-title":"Omega"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","volume":"27","author":"J.R. Current","year":"1986","unstructured":"Current, J.R., ReVelle, C.S., Cohon, J.L.: The hierarchical network design problem. European Journal of Operational Research\u00a027(1), 57\u201366 (1986)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF02071982","volume":"33","author":"C. Duin","year":"1991","unstructured":"Duin, C., Volgenant, T.: The multi-weighted Steiner tree problem. Annals of Operations Research\u00a033(6), 451\u2013469 (1991)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.cor.2010.07.002","volume":"38","author":"S. Gollowitzer","year":"2011","unstructured":"Gollowitzer, S., Ljubi\u0107, I.: MIP models for connected facility location: A theoretical and computational study. Computers & Operations Research\u00a038(2), 435\u2013449 (2011)","journal-title":"Computers & Operations Research"},{"key":"8_CR8","volume-title":"Facility Location: Applications and Theory","author":"E. Gourdin","year":"2001","unstructured":"Gourdin, E., Labb\u00e9, M., Yaman, H.: Telecommunication and location - a survey. In: Drezner, Z., Hamacher, H. (eds.) Facility Location: Applications and Theory. Springer, Heidelberg (2001)"},{"issue":"3","key":"8_CR9","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"},{"issue":"11","key":"8_CR10","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(11), 3599\u20133611 (2008)","journal-title":"Computers & Operations Research"},{"unstructured":"Gouveia, L., Telhada, J.: Distance-constrained hierarchical networks. In: Proceedings of International Network Optimization Conference, INOC 2005, pp. B2.416\u2013B2.421 (2005)","key":"8_CR11"},{"unstructured":"Gurobi: Gurobi Optimization, http:\/\/www.gurobi.com\/","key":"8_CR12"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/opre.47.1.81","volume":"47","author":"A.D. Jongh","year":"1999","unstructured":"Jongh, A.D., Gendreau, M., Labb\u00e9, M.: Finding disjoint routes in telecommunications networks with two technologies. Operations Research\u00a047(1), 81\u201392 (1999)","journal-title":"Operations Research"},{"issue":"4","key":"8_CR14","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."},{"doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on steiner tree problems in graphs. Tech. rep., Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (2000), http:\/\/elib.zib.de\/steinlib","key":"8_CR15","DOI":"10.1007\/978-1-4613-0255-1_9"},{"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)","key":"8_CR16","DOI":"10.1016\/j.endm.2010.05.027"},{"doi-asserted-by":"crossref","unstructured":"Magnanti, T., Wolsey, L.: Optimal trees. In: Handbook in Operations Research and Management Science, pp. 503\u2013615 (1995)","key":"8_CR17","DOI":"10.1016\/S0927-0507(05)80126-4"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:27:54Z","timestamp":1560558474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}