{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:19Z","timestamp":1725888259899},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_9","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"99-110","source":"Crossref","is-referenced-by-count":3,"title":["Cutting Planes from Wide Split Disjunctions"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bonami","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Tramontani","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1287\/mnsc.1050.0382","volume":"51","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Reduce-and-split cuts: Improving the performance of mixed-integer Gomory cuts. Manag. Sci. 51, 1720\u20131732 (2005)","journal-title":"Manag. Sci."},{"key":"9_CR2","doi-asserted-by":"crossref","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.: Split closure and intersection cuts. Math. Program. 102, 457\u2013493 (2005)","journal-title":"Math. Program."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-13193-6_20","volume-title":"Experimental Algorithms","author":"ET Coughlan","year":"2010","unstructured":"Coughlan, E.T., L\u00fcbbecke, M.E., Schulz, J.: A Branch-and-price algorithm for multi-mode resource leveling. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 226\u2013238. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13193-6_20"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-18008-3_18","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"F Furini","year":"2015","unstructured":"Furini, F., Ljubi\u0107, I., Sinnl, M.: ILP and CP formulations for the lazy bureaucrat problem. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 255\u2013270. Springer, Cham (2015). doi:\n10.1007\/978-3-319-18008-3_18"},{"key":"9_CR9","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45, 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"9_CR11","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, UK (1990)"},{"key":"9_CR12","unstructured":"Pisinger, D.: \nhttp:\/\/www.diku.dk\/pisinger\/codes.html\n\n. Accessed 19 Feb 2016"},{"key":"9_CR13","unstructured":"Wiese, S: On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming. Ph.D. thesis, University of Bologna (2016)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:06:27Z","timestamp":1495544787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}