{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:35Z","timestamp":1725605555217},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_18","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"145-149","source":"Crossref","is-referenced-by-count":0,"title":["The Two Layer Network Design Problem"],"prefix":"10.1007","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/net.20098","volume":"47","author":"Y. Agarwal","year":"2006","unstructured":"Agarwal, Y.: K-partition-based facets of the network design problem. Networks\u00a047(3), 123\u2013139 (2006)","journal-title":"Networks"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A.: On capacitated network design cut-set polyhedra. Mathematical Programming\u00a092, 425\u2013437 (2002)","journal-title":"Mathematical Programming"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.disopt.2006.10.002","volume":"4","author":"P. Avella","year":"2007","unstructured":"Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. Disc. Opt.\u00a04, 103\u2013114 (2007)","journal-title":"Disc. Opt."},{"issue":"5","key":"18_CR4","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1109\/90.879346","volume":"8","author":"D. Banerjee","year":"2000","unstructured":"Banerjee, D., Mukherjee, B.: Wavelength-routed optical networks: Linear formulatation, resource budgeting tradeoffs, and a reconfiguration study. IEEE Transactions on Networking\u00a08(5), 598\u2013607 (2000)","journal-title":"IEEE Transactions on Networking"},{"key":"18_CR5","unstructured":"Belotti, P., Koster, A.M.C.A., Orlowski, S.: A cut&branch&price approach to two-layer network design. In: The 8th INFORMS Telecommunications Conference, Dallas, TX (2006)"},{"key":"18_CR6","unstructured":"Belotti, P., Malucelli, F.: Multilayer network design: a row-column generation algorithm. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol.\u00a03, pp. 422\u2013427 (March 2005)"},{"key":"18_CR7","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.Y.: Mininum cost capacity installation for multicommodity flows. Mathematical Programming\u00a081, 177\u2013199 (1998)","journal-title":"Mathematical Programming"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated network design - polyhedral structure and computation. INFORMS Journal on Computing\u00a08, 243\u2013259 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10479-006-0047-2","volume":"146","author":"S. Borne","year":"2006","unstructured":"Borne, S., Gourdin, E., Liau, B., Mahjoub, A.: Design of survivable IP-over-optical networks. Ann. Oper. Res.\u00a0146, 41\u201373 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/opre.47.5.693","volume":"47","author":"G. Dahl","year":"1999","unstructured":"Dahl, G., Martin, A., Stoer, M.: Routing through virtual paths in layered telecommunication networks. Operations Research\u00a047(5), 693\u2013702 (1999)","journal-title":"Operations Research"},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.orl.2009.05.007","volume":"37","author":"B. Fortz","year":"2009","unstructured":"Fortz, B., Poss, M.: An improved benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett.\u00a037(5), 777\u2013795 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11067-007-9038-3","volume":"8","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Patricio, P., de Sousa, A.: Hop-constrained node survivable network design: An application to MPLS over WDM. Networks and Spatial Economics\u00a08(1), 3\u201321 (2008), \n                    \n                      http:\/\/ideas.repec.org\/a\/kap\/netspa\/v8y2008i1p3-21.html","journal-title":"Networks and Spatial Economics"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck, O.: A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming\u00a086, 17\u201339 (1999)","journal-title":"Mathematical Programming"},{"key":"18_CR14","first-page":"129","volume":"13","author":"M. Iri","year":"1971","unstructured":"Iri, M.: On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan\u00a013, 129\u2013135 (1971)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"18_CR15","first-page":"1","volume-title":"Single-layer Cuts for Multi-Layer Network Design Problems, ch.\u00a01","author":"A. Koster","year":"2008","unstructured":"Koster, A., Orlowski, S., Raack, C., Baier, G., Engel, T.: Single-layer Cuts for Multi-Layer Network Design Problems, ch.\u00a01, pp. 1\u201323. Springer, Heidelberg (2008), selected proceedings 9th INFORMS Telecommunications Conference"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(85)90004-6","volume":"11","author":"M. Lomonosov","year":"1985","unstructured":"Lomonosov, M.: Combinatorial approaches to multiflow problems. Disc. Appl. Math.\u00a011, 1\u201393 (1985)","journal-title":"Disc. Appl. Math."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Mathematical Programming\u00a060, 233\u2013250 (1993)","journal-title":"Mathematical Programming"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Operations Research\u00a043, 142\u2013157 (1995)","journal-title":"Operations Research"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Mattia, S.: Solving survivable two-layer network design problems by metric inequalities. Computational Optimization and Applications (2010), doi: 10.1007\/s10589-010-9364-0","DOI":"10.1007\/s10589-010-9364-0"},{"key":"18_CR20","unstructured":"Mattia, S.: A polyhedral study of the capacity formulation of the multilayer network design problem. Optimization Online 2011-03-2947 (2011)"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"18","author":"K. Onaga","year":"1971","unstructured":"Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in network. IEEE Trans. Circuit Theory\u00a018(4), 425\u2013429 (1971)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"18_CR22","unstructured":"Orlowski, S., Koster, A., Raack, C., Wess\u00e4ly, R.: Two-layer network design by branch-and-cut featuring MIP-based heuristics. In: Proceedings of the INOC 2007, Spa, Belgium (2007), \n                    \n                      http:\/\/www.poms.ucl.ac.be\/inoc2007\/Papers\/author.89\/paper\/paper.89.pdf"},{"key":"18_CR23","unstructured":"Orlowski, S., Wess\u00e4ly, R.: An integer programming model for multi-layer network design. ZIB Preprint ZR-04-49, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (December 2004), \n                    \n                      http:\/\/www.zib.de\/PaperWeb\/abstracts\/ZR-04-49"},{"key":"18_CR24","unstructured":"Yuan, D.: An annotated bibliography in communication network design and routing. Ph.D. thesis, Institute of Technology, Link\u00f6pings Universitet (2001)"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T10:01:05Z","timestamp":1554199265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}