{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T22:27:16Z","timestamp":1775860036165,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1023\/a:1018368920203","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"189-193","source":"Crossref","is-referenced-by-count":17,"title":["Projection with a Minimal System of Inequalities"],"prefix":"10.1007","volume":"10","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"156994_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria, and G. Cornu\u00e9jols, \"A lift-and-project cutting plane algorithm for mixed 0-1 programs,\" Mathematical Programming, vol. 58, pp. 295-324, 1993.","journal-title":"Mathematical Programming"},{"key":"156994_CR2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W.R. Pulleyblank, \"The perfectly matchable subgraph polytope of a bipartite graph,\" Networks, vol. 13, pp. 495-516, 1983.","journal-title":"Networks"},{"key":"156994_CR3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"E. Balas and W.R. Pulleyblank, \"The perfectly matchable subgraph polytope of an arbitrary graph,\" Combinatorica, vol. 9, pp. 321-337, 1989.","journal-title":"Combinatorica"},{"key":"156994_CR4","volume-title":"Two terminal steiner tree polyhedra","author":"M.O. Ball","year":"1987","unstructured":"M.O. Ball, W.G. Liu, and W.R. Pulleyblank, \u201cTwo terminal steiner tree polyhedra,\" Report No. 87466-OR, Instit\u00fct f\u00fcr \u00d6konometrie und Operations Research Bonn, 1987."},{"key":"156994_CR5","unstructured":"M.X. Goemans, \"Polyhedral description of trees and arborescences,\u201d in Integer Programming and Combinatorial Optimization (Proceedings of IPCO 2), E. Balas, G. Cornu\u00e9jols, and R. Kannan (Eds.), Carnegie Mellon University, 1992, pp. 1-14."},{"key":"156994_CR6","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, \"Cones of matrices and set-functions and 0-1 optimization,\" SIAM Journal on Optimization, vol. 1, pp. 166-190, 1991.","journal-title":"SIAM Journal on Optimization"},{"key":"156994_CR7","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley, 1988.","DOI":"10.1002\/9781118627372"},{"key":"156994_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.16.1.1","volume":"16","author":"M. Queyranne","year":"1991","unstructured":"M. Queyranne and Y. Wang, \"Single machine scheduling polyhedra with precedence constraints,\" Mathematics of Operations Research, vol. 16, pp. 1-20, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"156994_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"R.L. Rardin","year":"1993","unstructured":"R.L. Rardin and L.A. Wolsey, \"Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems,\" European Journal of Operational Research, vol. 71, pp. 95-109, 1993.","journal-title":"European Journal of Operational Research"},{"key":"156994_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"H. Sherali and W. Adams, \"A hierarchy of relaxations between the continuous and convenx hull representations for zero-one programming problems,\" SIAM Journal on Discrete Mathematics, vol. 3, pp. 411-430, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018368920203.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018368920203\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018368920203.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:30:29Z","timestamp":1752377429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018368920203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["156994"],"URL":"https:\/\/doi.org\/10.1023\/a:1018368920203","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}