{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:39:28Z","timestamp":1768073968324,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1263239"],"award-info":[{"award-number":["CMMI-1263239"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141210032"],"award-info":[{"award-number":["N000141210032"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10107-015-0975-1","type":"journal-article","created":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T21:01:28Z","timestamp":1452805288000},"page":"85-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts"],"prefix":"10.1007","volume":"160","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"975_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Inequalities from two rows of the simplex tableau. In: Fischetti, M., Williamson, D. (eds.), Integer Programming and Combinatorial Optimization, LNCS 4513, Springer, pp. 1\u201315 (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"975_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.: Split closure and intersection cuts. Math. Program. A 102, 457\u2013493 (2005)","journal-title":"Math. Program. A"},{"key":"975_CR3","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. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"975_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF01584553","volume":"2","author":"E Balas","year":"1972","unstructured":"Balas, E.: Integer programming and convex analysis: intersection cuts from outer polars. Math. Program. 2, 330\u2013382 (1972)","journal-title":"Math. Program."},{"key":"975_CR5","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive Programming: Properties of the Convex Hull of Feasible Points. MSRR No. 348, Carnegie Mellon University, July 1974. Published as an invited paper with a foreword by Cornu\u00e9jols, G., Pulleyblank, W.R. in Discrete Applied Mathematics, 89, pp. 3\u201344 (1998)","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"975_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"975_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1287\/ijoc.1120.0515","volume":"25","author":"E Balas","year":"2013","unstructured":"Balas, E., Cornu\u00e9jols, G., Kis, T., Nannicini, G.: Combining lift and project and reduce and split. INFORMS J. Comput. 25, 475\u2013487 (2013). doi:\n                    10.1287\/ijoc.1120.0515","journal-title":"INFORMS J. Comput."},{"key":"975_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.disopt.2015.10.001","volume":"18","author":"E Balas","year":"2015","unstructured":"Balas, E., Kis, T.: Intersection cuts\u2014standard and restricted. Discret. Optim. 18, 189\u2013192 (2015)","journal-title":"Discret. Optim."},{"key":"975_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"135","author":"E Balas","year":"2013","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. A 135, 19\u201335 (2013). doi:\n                    10.1007\/s10107-011-0483-x","journal-title":"Math. Program. A"},{"key":"975_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0\u20131 programming. Math. Program. B 94, 221\u2013245 (2003)","journal-title":"Math. Program. B"},{"key":"975_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-013-0008-x","volume":"1","author":"E Balas","year":"2013","unstructured":"Balas, E., Qualizza, A.: Intersection cuts from multiple rows: a disjunctive programming approach. EURO J. Comput. Optim. 1, 3\u201349 (2013). doi:\n                    10.1007\/s13675-013-0008-x","journal-title":"EURO J. Comput. Optim."},{"key":"975_CR12","unstructured":"Balas, E., Serra, T.: Experiments with some cuts from non-split disjunctions. In: Technical Report in Preparation, CMU (2015)"},{"key":"975_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.orl.2010.02.006","volume":"38","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38, 153\u2013155 (2010). doi:\n                    10.1016\/j.orl.2010.02.006","journal-title":"Oper. Res. Lett."},{"key":"975_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Oper. Res. Manag. Sci. 16, 105\u2013120 (2011). doi:\n                    10.1016\/j.sorms.2011.03.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"975_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-013-0634-3","volume":"144","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Del Pia, A.: Disjunctive programming and relaxations of polyhedra. Math. Program. A 144, 307\u2013314 (2014)","journal-title":"Math. Program. A"},{"issue":"6","key":"975_CR16","doi-asserted-by":"publisher","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"S Dey","year":"2010","unstructured":"Dey, S., Wolsey, L.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20(6), 2890\u20132912 (2010)","journal-title":"SIAM J. Optim."},{"key":"975_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"DR Fulkerson","year":"1974","unstructured":"Fulkerson, D.R., Nemhauser, G.L., Trotter, L.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner Triple Systems. Math. Program. Study 2, 72\u201381 (1974)","journal-title":"Math. Program. Study"},{"key":"975_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2, 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"975_CR19","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.disopt.2014.02.001","volume":"12","author":"T Kis","year":"2014","unstructured":"Kis, T.: Lift-and-project for general two-term disjunctions. Discrete Optim. 12, 98\u2013114 (2014). doi:\n                    10.1016\/j.disopt.2014.02.001","journal-title":"Discrete Optim."},{"key":"975_CR20","first-page":"177","volume-title":"Mathematical Programming","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming, pp. 177\u2013201. KTK Scientific Publishers, Tokyo (1989)"},{"key":"975_CR21","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440147","volume-title":"Combinatorial Mathematics","author":"HJ Ryser","year":"1963","unstructured":"Ryser, H.J.: Combinatorial Mathematics. Wiley, New York (1963)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0975-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0975-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0975-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0975-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:18:16Z","timestamp":1589645896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0975-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["975"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0975-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"6 January 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}