{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:44Z","timestamp":1781345744006,"version":"3.54.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1007\/bf01581273","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:48:26Z","timestamp":1114681706000},"page":"295-324","source":"Crossref","is-referenced-by-count":500,"title":["A lift-and-project cutting plane algorithm for mixed 0\u20131 programs"],"prefix":"10.1007","volume":"58","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas, \u201cIntersection cuts \u2014 A new type of cutting planes for integer programming,\u201dOperations Research 19 (1971) 19\u201339.","journal-title":"Operations Research"},{"key":"CR2","series-title":"MSRR","volume-title":"Intersection cuts for disjunctive constraints","author":"E. Balas","year":"1974","unstructured":"E. Balas, \u201cIntersection cuts for disjunctive constraints,\u201d MSRR No. 330, Carnegie Mellon University (Pittsburgh, PA, 1974)."},{"key":"CR3","series-title":"MSRR","volume-title":"Disjunctive Programming: Properties of the convex hull of feasible points","author":"E. Balas","year":"1974","unstructured":"E. Balas, \u201cDisjunctive Programming: Properties of the convex hull of feasible points,\u201d MSRR No. 348, Carnegie Mellon University (Pittsburgh, PA, 1974)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"E. Balas, \u201cDisjunctive Programming,\u201dAnnals of Discrete Mathematics 5 (1979) 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"E. Balas, \u201cDisjunctive Programming and a hierarchy of relaxations for discrete optimization problems,\u201dSIAM Journal on Algebraic and Discrete Methods 6 (1985) 466\u2013486.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"4","key":"CR6","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E. Balas","year":"1980","unstructured":"E. Balas and R. Jeroslow, \u201cStrengthening cuts for mixed integer programs,\u201dEuropean Journal of Operations Research 4(4) (1980) 224\u2013234.","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E. Balas","year":"1980","unstructured":"E. Balas and C. Martin, \u201cPivot and complement \u2014 A heuristic for 0\u20131 programming,\u201dManagement Science 26(1) (1980) 86\u201396.","journal-title":"Management Science"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01587096","volume":"44","author":"E. Balas","year":"1989","unstructured":"E. Balas, J. Tama and J. Tind, \u201cSequential convexification in reverse convex and disjunctive programming,\u201dMathematical Programming 44 (1989) 337\u2013350.","journal-title":"Mathematical Programming"},{"key":"CR9","volume-title":"Programmes lin\u00e9aires en variables bivalentes \u2014 Algorithme de Balas","author":"B. Bouvier","year":"1965","unstructured":"B. Bouvier and G. Messoumian, \u201cProgrammes lin\u00e9aires en variables bivalentes \u2014 Algorithme de Balas,\u201d Universit\u00e9 de Grenoble (Grenoble, France, 1965)."},{"issue":"7","key":"CR10","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"C. Carpaneto","year":"1980","unstructured":"C. Carpaneto and P. Toth, \u201cSome new branching and bounding criteria for the asymmetric traveling salesman problem,\u201dManagement Science 26(7) (1980) 736\u2013743.","journal-title":"Management Science"},{"issue":"5","key":"CR11","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E. Johnson, M. Padberg, \u201cSolving large-scale zero\u2013one linear programming problems,\u201dOperations Research 31(5) (1983) 803\u2013834.","journal-title":"Operations Research"},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M. Fischetti","year":"1992","unstructured":"M. Fischetti and P. Toth, \u201cAn additive bounding procedure for the asymmetric traveling salesman problem,\u201dMathematical Programming 53(2) (1992) 173\u2013197.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover, \u201cConvexity cuts and cut search,\u201dOperations Research 21 (1973) 123\u2013134.","journal-title":"Operations Research"},{"key":"CR14","volume-title":"\u201cAn algorithm for the mixed integer problem,\u201d RM-2597","author":"R. Gomory","year":"1960","unstructured":"R. Gomory, \u201cAn algorithm for the mixed integer problem,\u201d RM-2597, The Rand Corporation (Santa Monica, CA, 1960)."},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"R. Jeroslow","year":"1980","unstructured":"R. Jeroslow, \u201cA cutting plane game for facial disjunctive programs,\u201dSIAM Journal on Control and Optimization 18(3) (1980) 264\u2013280.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/05695557408974946","volume":"6","author":"C. Lemke","year":"1974","unstructured":"C. Lemke and K. Spielberg, \u201cA capital budgeting heuristic algorithm using exchange operations,\u201dAIEE Transactions 6 (1974) 143\u2013150.","journal-title":"AIEE Transactions"},{"issue":"2","key":"CR17","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver, \u201cCones of matrices and set-functions and 0\u20131 optimization,\u201dSIAM Journal on Optimization 1(2) (1991) 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M. Padberg","year":"1987","unstructured":"M. Padberg and G. Rinaldi, \u201cOptimization of a 537-city TSP by branch and cut,\u201dOperations Research Letters 6 (1987) 1\u20138.","journal-title":"Operations Research Letters"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"C. Petersen","year":"1967","unstructured":"C. Petersen, \u201cComputational experience with variants of the Balas algorithm applied to the selection of R&D projects,\u201dManagement Science 13 (1967) 736\u2013750.","journal-title":"Management Science"},{"key":"CR20","unstructured":"B. Repetto, personal communication (1991)."},{"key":"CR21","volume-title":"Integer Programming","author":"H. Salkin","year":"1975","unstructured":"H. Salkin,Integer Programming (Addison-Wesley, Reading, MA, 1975)."},{"key":"CR22","volume-title":"\u201cA hierarchy of relaxations and convex hull representations for mixedinteger zero\u2013one programming problems,\u201d Technical Report","author":"H. Sherali","year":"1989","unstructured":"H. Sherali and W. Adams, \u201cA hierarchy of relaxations and convex hull representations for mixedinteger zero\u2013one programming problems,\u201d Technical Report, Virginia Tech (Blacksburg, VA, 1989)."},{"issue":"3","key":"CR23","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"H. Sherali and W. Adams, \u201cA hierarchy of relaxations between the continuous and convex hull representations for zero\u2014one programming problems,\u201dSIAM Journal on Discrete Mathematics 3(3) (1990) 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"CR24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T. Roy Van","year":"1987","unstructured":"T. Van Roy and L. Wolsey, \u201cSolving mixed integer programming problems using automatic reformulation,\u201dOperations Research 35(1) (1987) 45\u201347.","journal-title":"Operations Research"},{"key":"CR25","volume-title":"On Gomory's mixed integer algorithm","author":"W. White","year":"1961","unstructured":"W. White, \u201cOn Gomory's mixed integer algorithm,\u201d Senior Thesis, Department of Mathematics, Princeton University (Princeton, NJ, 1961)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581273.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581273\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01581273"],"URL":"https:\/\/doi.org\/10.1007\/bf01581273","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}