{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:16:33Z","timestamp":1761894993015,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022494"},{"type":"electronic","value":"9783642022500"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02250-0_3","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T11:17:06Z","timestamp":1258456626000},"page":"95-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Orlowski","sequence":"first","affiliation":[]},{"given":"Christian","family":"Raack","sequence":"additional","affiliation":[]},{"given":"Arie M. C. A.","family":"Koster","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Baier","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Engel","sequence":"additional","affiliation":[]},{"given":"Pietro","family":"Belotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,9]]},"reference":[{"unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007). http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2007\/1611\/","key":"3_CR1"},{"doi-asserted-by":"crossref","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1\u201341 (2009). URL http:\/\/scip.zib.de\/","key":"3_CR2","DOI":"10.1007\/s12532-008-0001-1"},{"unstructured":"Alevras, D., Gr\u00f6tschel, M., Wess\u00e4ly, R.: A network dimensioning tool. ZIB Technical Report SC-96-49, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (1996)","key":"3_CR3"},{"key":"3_CR4","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 92, 425\u2013437 (2002)","journal-title":"Mathematical Programming"},{"unstructured":"Baier, G., Engel, T., Autenrieth, A., Leisching, P.: Mehrperiodenplanung optischer Transportnetze. In: 7. ITG-Fachtagung Photonische Netze, Leipzig, Germany, vol. 193, pp. 153\u2013160. VDE-Verlag (2006)","key":"3_CR5"},{"unstructured":"Belotti, P., Capone, A., Carello, G., Malucelli, F., Senaldi, F., Totaro, A.: Design of multi-layer networks with traffic grooming and statistical multiplexing. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)","key":"3_CR6"},{"key":"3_CR7","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.: Mininum cost capacity installation for multicommodity flows. Mathematical Programming 81, 177\u2013199 (1998)","journal-title":"Mathematical Programming"},{"issue":"3","key":"3_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 \u2013 polyhedral structure and computation. INFORMS Journal on Computing 8(3), 243\u2013259 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0167-6377(89)90029-1","volume":"8","author":"S. Chopra","year":"1989","unstructured":"Chopra, S.: On the spanning tree polyhedron. Operations Research Letters 8, 25\u201329 (1989)","journal-title":"Operations Research Letters"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(98)00024-9","volume":"86","author":"S. Chopra","year":"1998","unstructured":"Chopra, S., Gilboa, I., Sastry, S. T.: Source sink flows with capacity installation in batches. Discrete Applied Mathematics 86, 165\u2013192 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"3_CR11","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 47(5), 693\u2013702 (1999)","journal-title":"Operations Research"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1287\/ijoc.1060.0197","volume":"19","author":"M. Dawande","year":"2007","unstructured":"Dawande, M., Gupta, R., Naranpanawe, S., Sriskandarajah, C.: A traffic-grooming algorithm for wavelength-routed optical networks. INFORMS Journal on Computing 19(4), 565\u2013574 (2007).","journal-title":"INFORMS Journal on Computing"},{"unstructured":"Fortz, B., Poss, M.: An improved Benders decomposition applied to a multi-layer network design problem (2008). Optimization Online preprint 1919","key":"3_CR13"},{"key":"3_CR14","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 86, 17\u201339 (1999)","journal-title":"Mathematical Programming"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.ejor.2004.09.006","volume":"171","author":"H. H\u00f6ller","year":"2006","unstructured":"H\u00f6ller, H., Voss, S.: A heuristic approach for combined equipment-planning and routing in multi-layer SDH\/WDM networks. European Journal of Operational Research 171(3), 787\u2013796 (2006)","journal-title":"European Journal of Operational Research"},{"unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA: CPLEX 10.1 Reference Manual (2006).URL http:\/\/www.cplex.com","key":"3_CR16"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2006.07.046","volume":"183","author":"A. Knippel","year":"2007","unstructured":"Knippel, A., Lardeux, B.: The multi-layered network design problem. European Journal of Operational Research 183(1), 87\u201399 (2007)","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"crossref","unstructured":"Koster, A. M. C. A., Orlowski, S., Raack, C., Baier, G., Engel, T.: Single-layer cuts for multi-layer network design problems. In: Telecommunications Modeling, Policy, and Technology, chap. 1, pp. 1\u201323. Springer (2008). URL http:\/\/dx.doi.org\/10.1007\/978-0-387-77780-1_1. Selected proceedings 9th INFORMS Telecommunications Conference","key":"3_CR18","DOI":"10.1007\/978-0-387-77780-1_1"},{"unstructured":"Koster, A. M. C. A., Zymolka, A.: Minimum converter wavelength assignment in all-optical networks. In: Proceedings of ONDM 2004, pp. 517\u2013535. The 8th IFIP Working Conference on Optical Network Design and Modelling, Ghent, Belgium (2004)","key":"3_CR19"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1111\/j.1467-9574.2007.00351.x","volume":"61","author":"A. M. C. A. Koster","year":"2007","unstructured":"Koster, A. M. C. A., Zymolka, A.: Tight LP-based lower bounds for wavelength conversion in optical networks. Statistica Neerlandica 61(1), 115\u2013136 (2007)","journal-title":"Statistica Neerlandica"},{"unstructured":"Kubilinskas, E., Pi\u00f3ro, M.: An IP\/MPLS over WDM network design problem. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 3, pp. 718\u2013725 (2005)","key":"3_CR21"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"33","author":"T. L. Magnanti","year":"1993","unstructured":"Magnanti, T. L., Mirchandani, P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 33, 103\u2013121 (1993)","journal-title":"Networks"},{"issue":"3","key":"3_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L. A.: Aggregation and mixed integer rounding to solve MIPs. Operations Research 49(3), 363\u2013371 (2001)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L. A.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)","key":"3_CR24","DOI":"10.1002\/9781118627372"},{"unstructured":"Orlowski, S., Koster, A. M. C. A., Raack, C., Wess\u00e4ly, R.: Two-layer network design by branch-and-cut featuring MIP-based heuristics. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)","key":"3_CR25"},{"unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2013Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007). http:\/\/sndlib.zib.de","key":"3_CR26"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F. Ortega","year":"2003","unstructured":"Ortega, F., Wolsey, L. A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41, 143\u2013158 (2003)","journal-title":"Networks"},{"unstructured":"Raack, C., Koster, A. M. C. A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks (2009). Submitted for publication, available in parts as ZIB Reports 07-08 and 07-14, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin","key":"3_CR28"},{"unstructured":"Raghavan, S., Stanojevi\u0107, D.: WDM optical design using branch-and-price (2007). Robert H. Smith School of Business, University of Maryland","key":"3_CR29"},{"key":"3_CR30","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.: Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing 6, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"unstructured":"Wolsey, L. A.: Integer Programming. John Wiley & Sons (1998)","key":"3_CR31"}],"container-title":["Texts in Theoretical Computer Science. An EATCS Series","Graphs and Algorithms in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02250-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:28:49Z","timestamp":1674073729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02250-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022494","9783642022500"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02250-0_3","relation":{},"ISSN":["1862-4499"],"issn-type":[{"type":"print","value":"1862-4499"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"9 November 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}