{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T20:02:54Z","timestamp":1768075374117,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-012-0006-4","type":"journal-article","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T08:00:52Z","timestamp":1358755252000},"page":"51-69","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reflections on generating (disjunctive) cuts"],"prefix":"10.1016","volume":"1","author":[{"given":"Florent","family":"Cadoux","sequence":"first","affiliation":[]},{"given":"Claude","family":"Lemar\u00e9chal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-012-0006-4_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann Discret Math"},{"issue":"3","key":"10.1007\/s13675-012-0006-4_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0-1 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-012-0006-4_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.20137","article-title":"Acceleration of cutting plane and column generation algorithms: application to network design","volume":"49","author":"Benameur","year":"2007","journal-title":"Networks"},{"issue":"4","key":"10.1007\/s13675-012-0006-4_CR4","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","article-title":"Using rank-1 lift-and-project closures to generate cuts for 0G1 MIPs, a computational investigation","volume":"2","author":"Bonami","year":"2005","journal-title":"Disc Opt"},{"issue":"1","key":"10.1007\/s13675-012-0006-4_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","article-title":"Fenchel cutting planes for integer programs","volume":"42","author":"Boyd","year":"1994","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-012-0006-4_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10107-008-0245-6","article-title":"Computing deep facet-defining disjunctive cuts for mixed-integer programming","volume":"122","author":"Cadoux","year":"2008","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-012-0006-4_CR7","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","article-title":"A convex-analysis perspective on disjunctive cuts","volume":"106","author":"Cornu\u00e9jols","year":"2005","journal-title":"Math Program"},{"key":"10.1007\/s13675-012-0006-4_CR8","doi-asserted-by":"crossref","unstructured":"Fischetti M, Salvagnin D (2010) An in-out approach to disjunctive optimization. In: Lodi A, et al (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, number 6140 in Lecture Notes in Computer Sciences. pp 136\u2013140","DOI":"10.1007\/978-3-642-13520-0_17"},{"key":"10.1007\/s13675-012-0006-4_CR9","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty J-B, Lemar\u00e9chal C (2001) Fundamentals of convex analysis. Springer, Berlin","DOI":"10.1007\/978-3-642-56468-0"},{"key":"10.1007\/s13675-012-0006-4_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/imanum\/6.2.137","article-title":"A method for solving certain quadratic programming problems arising in nonsmooth optimization","volume":"6","author":"Kiwiel","year":"1986","journal-title":"IMA J Numer Anal"},{"key":"10.1007\/s13675-012-0006-4_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s002110050065","article-title":"A Cholesky dual method for proximal piecewise linear programming","volume":"68","author":"Kiwiel","year":"1994","journal-title":"Numeri Math"},{"key":"10.1007\/s13675-012-0006-4_CR12","unstructured":"Perregaard M (2003) Generating disjunctive cuts for mixed integer programs. Ph.D. thesis, Carnegie Mellon University"},{"key":"10.1007\/s13675-012-0006-4_CR13","doi-asserted-by":"crossref","unstructured":"Perregaard M, Balas E (2001) Generating cuts from multiple-term disjunctions. In: Aardal K et al (eds) Integer programming and combinatorial optimization, number 2081 in Lecture Notes in Computer Science, pp 348\u2013360","DOI":"10.1007\/3-540-45535-3_27"},{"issue":"1","key":"10.1007\/s13675-012-0006-4_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00934337","article-title":"A cutting-plane algorithm with linear and geometric rates of convergence","volume":"36","author":"Topkis","year":"1982","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"10.1007\/s13675-012-0006-4_CR15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","article-title":"Finding the nearest point in a polytope","volume":"11","author":"Wolfe","year":"1976","journal-title":"Math Program"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-012-0006-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-012-0006-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:37Z","timestamp":1761882337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000113"],"URL":"https:\/\/doi.org\/10.1007\/s13675-012-0006-4","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reflections on generating (disjunctive) cuts","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-012-0006-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}