{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:17:01Z","timestamp":1649215021459},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T00:00:00Z","timestamp":1360195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-013-0634-3","type":"journal-article","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T01:58:06Z","timestamp":1360115886000},"page":"307-314","source":"Crossref","is-referenced-by-count":2,"title":["Disjunctive programming and relaxations of polyhedra"],"prefix":"10.1007","volume":"144","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Del Pia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"issue":"3","key":"634_CR1","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. A 102(3), 457\u2013493 (2005)","journal-title":"Math. Program. A"},{"issue":"1","key":"634_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed integer linear sets based on lattice point free convex sets. Math. Oper. Res. 35(1), 233\u2013256 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"634_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"key":"634_CR4","doi-asserted-by":"crossref","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. A 137(1\u20132), 19\u201335 (2013)","DOI":"10.1007\/s10107-011-0483-x"},{"issue":"2\u20133","key":"634_CR5","doi-asserted-by":"crossref","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-1 programming. Math. Program. 94(2\u20133), 221\u2013245 (2003)","journal-title":"Math. Program."},{"key":"634_CR6","unstructured":"Basu, A., Cornu\u00e9jols, G., Margot, F.: Intersection cuts with infinite split rank. Math. Oper. Res. 37(1), 21\u201340 (2012)"},{"issue":"3","key":"634_CR7","doi-asserted-by":"crossref","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.: Eqivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3), 153\u2013155 (2010)","journal-title":"Oper. Res. Lett."},{"key":"634_CR8","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming. In preparation, (2012)"},{"issue":"3","key":"634_CR9","doi-asserted-by":"crossref","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.: A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39(3), 198\u2013199 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"634_CR10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1287\/moor.1110.0527","volume":"37","author":"A Pia Del","year":"2012","unstructured":"Del Pia, A.: On the rank of disjunctive cuts. Math. Oper. Res. 37(2), 372\u2013378 (2012)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"634_CR11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-011-0476-9","volume":"135","author":"A Pia Del","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. A 135(1), 397\u2013412 (2012)","journal-title":"Math. Program. A"},{"issue":"1","key":"634_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107-009-0329-y","volume":"130","author":"SS Dey","year":"2011","unstructured":"Dey, S.S.: A note on the split rank of intersection cuts. Math. Program. A 130(1), 107\u2013124 (2011)","journal-title":"Math. Program. A"},{"key":"634_CR13","unstructured":"J\u00f6rg, M.: $$k$$ -disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. PhD thesis, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, (2008)"},{"key":"634_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0634-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0634-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0634-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:02Z","timestamp":1559124002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0634-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0634-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,7]]}}}