{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T13:12:46Z","timestamp":1680441166781},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T00:00:00Z","timestamp":1251331200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10479-009-0623-3","type":"journal-article","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T07:24:25Z","timestamp":1251271465000},"page":"19-31","source":"Crossref","is-referenced-by-count":2,"title":["Projecting systems of linear inequalities with binary variables"],"prefix":"10.1007","volume":"188","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,27]]},"reference":[{"key":"623_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"623_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0167-6377(88)90058-2","volume":"7","author":"E. Balas","year":"1988","unstructured":"Balas, E. (1988). On the convex hull of the union of certain polyhedra. Operations Research Letters, 7, 279\u2013284.","journal-title":"Operations Research Letters"},{"key":"623_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(98)00096-1","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas, E. (1998). Disjunctive programming: properties of the convex hull of feasible points. Discrete Applied Mathematics, 89, 1\u201344. Invited paper.","journal-title":"Discrete Applied Mathematics"},{"key":"623_CR4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"Balas, E., & Pulleyblank, W. R. (1983). The perfectly matchable subgraph polytope of a bipartite graph. Networks, 13, 495\u2013516.","journal-title":"Networks"},{"key":"623_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"Balas, E., & Pulleyblank, W. R. (1989). The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica, 9, 321\u2013337.","journal-title":"Combinatorica"},{"key":"623_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., & Cornu\u00e9jols, G. (1993). A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Mathematical Programming, 58, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"623_CR7","unstructured":"Ball, M., Liu, W., & Pulleyblank, W. R. (1989). Two terminal Steiner tree polyhedra. In B. Cornet & H.\u00a0Tulkens (Eds.), Contributions to operations research and economics\u2014The twentieth anniversary of CORE, 1989 (pp.\u00a0251\u2013284)."},{"key":"623_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D. Bienstock","year":"2004","unstructured":"Bienstock, D., & Zuckerberg, M. (2004). Subset algebra lift operators for 0\u20131 integer programming. SIAM Journal on Optimization, 15, 63\u201395.","journal-title":"SIAM Journal on Optimization"},{"key":"623_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01588775","volume":"49","author":"C. Blair","year":"1990","unstructured":"Blair, C. (1990). Representation for multiple righthand sides. Mathematical Programming, 49, 1\u20135.","journal-title":"Mathematical Programming"},{"key":"623_CR10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0305-0548(86)90056-0","volume":"13","author":"C. Blair","year":"1988","unstructured":"Blair, C., Jeroslow, R. G., & Lowe, J. K. (1988). Some results and experiments in programming techniques for propositional logic. Computers and Operations Research, 13, 633\u2013645.","journal-title":"Computers and Operations Research"},{"key":"623_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201\u2013215.","journal-title":"Journal of the ACM"},{"key":"623_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"J. N. Hooker","year":"1992","unstructured":"Hooker, J. N. (1992). Generalized resolution for 0\u20131 linear inequalities. Annals of Mathematics and Artificial Intelligence, 6, 271\u2013286.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"623_CR13","first-page":"184","volume-title":"Lecture notes in computer science","author":"J. N. Hooker","year":"1992","unstructured":"Hooker, J. N. (1992). Logical inference and polyhedral projection. In Lecture notes in computer science (Vol. 626, pp. 184\u2013200). Berlin: Springer."},{"key":"623_CR14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0377-2217(88)90013-6","volume":"36","author":"R. W. Jeroslow","year":"1988","unstructured":"Jeroslow, R. W. (1988). A simplification for some disjunctive formulations. European Journal of Operational Research, 36, 116\u2013121.","journal-title":"European Journal of Operational Research"},{"key":"623_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., & Schrijver, A. (1991). Cones of matrices and set functions and 0\u20131 optimization. SIAM Journal on Optimization, 1, 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"key":"623_CR16","volume-title":"Production planning and mixed integer programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet, Y., & Wolsey, L. (2006). Production planning and mixed integer programming. Berlin: Springer."},{"key":"623_CR17","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2308219","volume":"59","author":"W. V. Quine","year":"1952","unstructured":"Quine, W. V. (1952). The problem of simplifying truth functions. American Mathematical Monthly, 59, 521\u2013531.","journal-title":"American Mathematical Monthly"},{"key":"623_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/0403026","volume":"3","author":"H. Sherali","year":"1990","unstructured":"Sherali, H., & Adams, W. (1990). A hierarchy of relaxations between the continuous and convex hull representations for 0\u20131 programming problems. SIAM Journal on Discrete Mathematics, 3, 311\u2013330.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"623_CR19","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0097-3165(76)90055-8","volume":"21","author":"H. C. Williams","year":"1976","unstructured":"Williams, H. C. (1976). Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A), 21, 118\u2013123.","journal-title":"Journal of Combinatorial Theory (A)"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0623-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0623-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0623-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:56Z","timestamp":1559138876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0623-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,27]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0623-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,27]]}}}