{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:16Z","timestamp":1725888256433},"publisher-location":"Cham","reference-count":16,"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_5","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"51-62","source":"Crossref","is-referenced-by-count":1,"title":["Approximation of Corner Polyhedra with\u00a0Families of Intersection Cuts"],"prefix":"10.1007","author":[{"given":"Gennadiy","family":"Averkov","sequence":"first","affiliation":[]},{"given":"Amitabh","family":"Basu","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72792-7_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Andersen","year":"2007","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1\u201315. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72792-7_1"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1137\/080744360","volume":"20","author":"K Andersen","year":"2009","unstructured":"Andersen, K., Wagner, C., Weismantel, R.: On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows. SIAM J. Optim. 20(2), 967\u2013982 (2009)","journal-title":"SIAM J. Optim."},{"key":"5_CR3","unstructured":"Averkov, G., Kr\u00fcmpelmann, J., Weltge, S.: Notions of maximality for integral lattice-free polyhedra: the case of dimension three (2015). http:\/\/arxiv.org\/abs\/1509.05200"},{"issue":"4","key":"5_CR4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G Averkov","year":"2011","unstructured":"Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4), 721\u2013742 (2011)","journal-title":"Math. Oper. Res."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-014-0775-z","volume":"150","author":"Y Awate","year":"2014","unstructured":"Awate, Y., Cornu\u00e9jols, G., Guenin, B., Tuncel, L.: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150, 459\u2013489 (2014)","journal-title":"Math. Program."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/054"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10107-009-0281-x","volume":"126","author":"A Basu","year":"2009","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: On the relative strength of split, triangle and quadrilateral cuts. Math. Program. Ser. A 126, 281\u2013314 (2009)","journal-title":"Math. Program. Ser. A"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35, 704\u2013720 (2010)","journal-title":"Math. Oper. Res."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34, 538\u2013546 (2009)","journal-title":"Math. Oper. Res."},{"key":"5_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming, vol. 271. Springer, Switzerland (2014)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-68891-4_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"SS Dey","year":"2008","unstructured":"Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 463\u2013475. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68891-4_32"},{"issue":"4","key":"5_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"5_CR13","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: State of the Art, pp. 177\u2013201. Mathematical Programming Society (1989)"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"R Meyer","year":"1974","unstructured":"Meyer, R.: On the existence of optimal solutions to integer and mixed-integer progamming problems. Math. Program. 7, 223\u2013235 (1974)","journal-title":"Math. Program."},{"key":"5_CR15","volume-title":"Convex Bodies: The Brunn-Minkowski Theory","author":"R Schneider","year":"2014","unstructured":"Schneider, R.: Convex Bodies: The Brunn-Minkowski Theory, vol. 44. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"5_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.orl.2008.09.005","volume":"37","author":"G Zambelli","year":"2009","unstructured":"Zambelli, G.: On degenerate multi-row gomory cuts. Oper. Res. Lett. 37(1), 21\u201322 (2009)","journal-title":"Oper. Res. Lett."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T18:04:24Z","timestamp":1692813864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}