{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:08:04Z","timestamp":1743005284352,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_49","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"363-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacitated Network Design"],"prefix":"10.1007","author":[{"given":"Christian","family":"Raack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T Achterberg","year":"2010","unstructured":"Achterberg, T., & Raack, C. (2010). The MCF-separator\u2014detecting and exploiting multi-commodity flows in MIPs. Mathematical Programming C, 2, 125\u2013165.","journal-title":"Mathematical Programming C"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., & Li, Y. (2005). Split closure and intersection cuts. Mathematical Programming, 102(3), 457\u2013493.","journal-title":"Mathematical Programming"},{"issue":"3","key":"49_CR3","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.orl.2011.02.011","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash, S., G\u00fcnl\u00fck, O., & Raack, C. (2011). A note on the MIR closure and basic relaxations of polyhedra. Operations Research Letters, 39(3), 198\u2013199.","journal-title":"Operations Research Letters"},{"key":"49_CR4","unstructured":"Gurobi Optimization. GUROBI, 2012"},{"key":"49_CR5","unstructured":"IBM. IBM ILOG CPLEX Optimizer, 2012"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.21497","volume":"61","author":"AMCA Koster","year":"2011","unstructured":"Koster, A. M. C. A., Kutschka, M., & Raack, C. (2011). Robust network design: Formulations, valid inequalities, and computations. Networks, 61(2), 128\u2013149.","journal-title":"Networks"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1002\/net.21482","volume":"61","author":"M Poss","year":"2012","unstructured":"Poss, M., & Raack, C. (2012). Affine recourse for the robust network design problem: Between static and dynamic routing. Networks, 61(2), 180\u2013198.","journal-title":"Networks"},{"key":"49_CR8","unstructured":"Raack C. (2012). Capacitated network design multi-commodity flow formulations, cutting planes, and demand uncertainty. PhD thesis, TU Berlin."},{"issue":"2","key":"49_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C Raack","year":"2011","unstructured":"Raack, C., Koster, A. M. C. A., Orlowski, S., & Wess\u00e4ly, R. (2011). On cut-based inequalities for capacitated network design polyhedra. Networks, 57(2), 141\u2013156.","journal-title":"Networks"},{"key":"49_CR10","unstructured":"Zuse Institute Berlin. SCIP\u2014Solving Constraint Integer Programs, 2012."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:34:24Z","timestamp":1676399664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_49"}},"subtitle":["Multi-commodity Flow Formulations, Cutting Planes, and Demand Uncertainty"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_49","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}