{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:08Z","timestamp":1725864728250},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319455860"},{"type":"electronic","value":"9783319455877"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-45587-7_7","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T04:01:21Z","timestamp":1473393681000},"page":"71-80","source":"Crossref","is-referenced-by-count":4,"title":["Benders Decomposition for Capacitated Network Design"],"prefix":"10.1007","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"7_CR1","unstructured":"GT-ITM: Georgia Tech Internetwork Topology Models. http:\/\/www.cc.gatech.edu\/fac\/Ellen.Zegura\/gt-itm\/"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Addis, B., Carello, G., Mattia, S.: Energy-aware survivable networks. In: Proceedings of INOC 2015. ENDM, vol. 52, pp. 133\u2013140 (2016)","DOI":"10.1016\/j.endm.2016.03.018"},{"issue":"3","key":"7_CR3","doi-asserted-by":"crossref","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 47(3), 123\u2013139 (2006)","journal-title":"Networks"},{"key":"7_CR4","doi-asserted-by":"crossref","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. 4, 103\u2013114 (2007)","journal-title":"Disc. Opt."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cor.2015.08.009","volume":"66","author":"A Benhamichea","year":"2016","unstructured":"Benhamichea, A., Mahjoub, R., Perrot, N., Uchoa, E.: Unsplittable non-additive capacitated network design using set functions polyhedra. Comp. Oper. Res. 66, 105\u2013115 (2016)","journal-title":"Comp. Oper. Res."},{"key":"7_CR6","first-page":"177","volume":"81","author":"D Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Prog. Ser. B 81, 177\u2013199 (1998)","journal-title":"Math. Prog. Ser. B"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.disopt.2006.10.007","volume":"4","author":"D Bienstock","year":"2007","unstructured":"Bienstock, D., Mattia, S.: Using mixed-integer programming to solve power grid blackout problems. Disc. Opt. 4, 115\u2013141 (2007)","journal-title":"Disc. Opt."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25, 13\u201326 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"7_CR9","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Oper. Res. 54(4), 756\u2013766 (2006)","journal-title":"Oper. Res."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T Crainic","year":"2001","unstructured":"Crainic, T., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fiwed charge network design. Disc. Appl. Math. 112, 73\u201399 (2001)","journal-title":"Disc. Appl. Math."},{"issue":"5","key":"7_CR11","doi-asserted-by":"crossref","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. 37(5), 777\u2013795 (2009)","journal-title":"Oper. Res. Lett."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s13675-014-0020-9","volume":"2","author":"B Gendron","year":"2014","unstructured":"Gendron, B., Larose, M.: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2, 55\u201375 (2014)","journal-title":"EURO J. Comput. Optim."},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"7_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. J. Oper. Res. Soc. Jpn. 13, 129\u2013135 (1971)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"1","key":"7_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.21486","volume":"62","author":"C Lee","year":"2013","unstructured":"Lee, C., Lee, K., Park, S.: Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1), 1\u201316 (2013)","journal-title":"Networks"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T Magnanti","year":"1993","unstructured":"Magnanti, T., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Prog. 60, 233\u2013250 (1993)","journal-title":"Math. Prog."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Disc. Appl. Math. 28, 59\u201370 (1990)","journal-title":"Disc. Appl. Math."},{"issue":"6","key":"7_CR18","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.orl.2012.09.009","volume":"40","author":"S Mattia","year":"2012","unstructured":"Mattia, S.: Separating tight metric inequalities by bilevel programming. Oper. Res. Lett. 40(6), 568\u2013572 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"7_CR19","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10589-010-9364-0","volume":"51","author":"S Mattia","year":"2012","unstructured":"Mattia, S.: Solving survivable two-layer network design problems by metric inequalities. Comput. Optim. Appl. 51(2), 809\u2013834 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"7_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/net.21488","volume":"62","author":"S Mattia","year":"2013","unstructured":"Mattia, S.: A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1), 17\u201326 (2013)","journal-title":"Networks"},{"issue":"3","key":"7_CR21","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia, S.: The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3), 619\u2013643 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"7_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.21621","volume":"66","author":"S Mattia","year":"2015","unstructured":"Mattia, S.: The cut property under demand uncertainty. Networks 66(2), 159\u2013168 (2015)","journal-title":"Networks"},{"issue":"4","key":"7_CR23","doi-asserted-by":"crossref","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. Circ. Theor. 18(4), 425\u2013429 (1971)","journal-title":"IEEE Trans. Circ. Theor."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45587-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:18:19Z","timestamp":1498342699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45587-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455860","9783319455877"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45587-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}