{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:16Z","timestamp":1786979056495,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130359","type":"print"},{"value":"9783642130366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_7","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:36:09Z","timestamp":1275986169000},"page":"85-95","source":"Crossref","is-referenced-by-count":7,"title":["On Lifting Integer Variables in Minimal Inequalities"],"prefix":"10.1007","author":[{"given":"Amitabh","family":"Basu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manoel","family":"Campelo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Conforti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giacomo","family":"Zambelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_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.: Cutting Planes from Two Rows of a Simplex Tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"7_CR2","doi-asserted-by":"publisher","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. Operations Research\u00a019, 19\u201339 (1971)","journal-title":"Operations Research"},{"key":"7_CR3","volume-title":"Graduate Studies in Mathematics","author":"A. Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity. In: Graduate Studies in Mathematics, vol.\u00a054. American Mathematical Society, Providence (2002)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Basu, A., Conforti, M., Cornuejols, G., Zambelli, G.: A Counterexample to a Conjecture of Gomory and Johnson. Mathematical Programming Ser. A (to appear, 2010)","DOI":"10.1007\/s10107-010-0407-1"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Basu, A., Conforti, M., Cornuejols, G., Zambelli, G.: Maximal Lattice-free Convex Sets in Linear Subspaces (2009) (manuscript)","DOI":"10.1287\/moor.1100.0461"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Basu, A., Conforti, M., Cornuejols, G., Zambelli, G.: Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM Journal of Discrete Mathematics (to appear, 2010)","DOI":"10.1137\/090756375"},{"key":"7_CR7","doi-asserted-by":"publisher","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. Mathematics of Operations Research\u00a034, 538\u2013546 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR8","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: A Geometric Perspective on Lifting (May 2009) (manuscript)"},{"key":"7_CR9","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":"S.S. 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.\u00a05035, pp. 463\u2013475. Springer, Heidelberg (2008)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained Infinite Group Relaxations of MIPs (March 2009) (manuscript)","DOI":"10.1137\/090754388"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"Gomory, R.E.: Some Polyhedra related to Combinatorial Problems. Linear Algebra and its Applications\u00a02, 451\u2013558 (1969)","journal-title":"Linear Algebra and its Applications"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some Continuous Functions Related to Corner Polyhedra, Part I. Mathematical Programming\u00a03, 23\u201385 (1972)","journal-title":"Mathematical Programming"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, E.L.: On the Group Problem for Mixed Integer Programming. In: Mathematical Programming Study, pp. 137\u2013179 (1974)","DOI":"10.1007\/BFb0120692"},{"key":"7_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York (1986)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"R.R. Meyer","year":"1974","unstructured":"Meyer, R.R.: On the Existence of Optimal Solutions to Integer and Mixed-Integer Programming Problems. Mathematical Programming\u00a07, 223\u2013235 (1974)","journal-title":"Mathematical Programming"}],"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-642-13036-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T22:42:48Z","timestamp":1635460968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}