{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:59:16Z","timestamp":1776329956905,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989,1]]},"DOI":"10.1007\/bf01582277","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:32:42Z","timestamp":1114677162000},"page":"45-55","source":"Crossref","is-referenced-by-count":52,"title":["On the 0, 1 facets of the set covering polytope"],"prefix":"10.1007","volume":"43","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"393","volume-title":"Survey of Mathematical Programming","author":"E. Balas","year":"1979","unstructured":"E. Balas, \u201cSet covering with cutting planes from conditional bounds,\u201d in: A. Prekopa, ed.,Survey of Mathematical Programming (North-Holland, Amsterdam, 1979) pp. 393\u2013422."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0120885","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas, \u201cCutting planes from conditional bounds: A new approach to set covering,\u201dMathematical Programming Study 12 (1980) 19\u201336.","journal-title":"Mathematical Programming Study"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas and A. C. Ho, \u201cSet covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study,\u201dMathematical Programming Study 12 (1980) 37\u201360.","journal-title":"Mathematical Programming Study"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M. Padberg, \u201cSet Partitioning: A Survey,\u201dSIAM Review 18 (1976) 710\u2013760.","journal-title":"SIAM Review"},{"key":"CR5","volume-title":"\u201cSome classes of facets of the set covering polytope,\u201d Research Report","author":"E. Balas","year":"1984","unstructured":"E. Balas and Shu-Ming Ng, \u201cSome classes of facets of the set covering polytope,\u201d Research Report, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1984)."},{"key":"CR6","volume-title":"\u201cOn the set covering polytope: I. All the facets with coefficients in {0, 1, 2},\u201d Research Report MSRR-522","author":"E. Balas","year":"1986","unstructured":"E. Balas and Shu-Ming Ng, \u201cOn the set covering polytope: I. All the facets with coefficients in {0, 1, 2},\u201d Research Report MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2.1.15","volume":"2","author":"E. Balas","year":"1977","unstructured":"E. Balas and E. Zemel, \u201cCritical cutsets of graphs and canonical facets of set-packing polytopes,\u201dMathematics of Operations Research 2 (1977) 15\u201319.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584535","volume":"2","author":"C. Berge","year":"1972","unstructured":"C. Berge, \u201cBalanced Matrices,\u201dMathematical Programming 2 (1972) 19\u201331.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1287\/moor.8.4.590","volume":"8","author":"D.C. Cho","year":"1983","unstructured":"D.C. Cho, M. Padberg and M.R. Rao, \u201cOn the uncapacitated plant location problem. II. Facets and Lifting theorems,\u201dMathematics of Operations Research 8 (1983) 590\u2013612.","journal-title":"Mathematics of Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e0tal","year":"1975","unstructured":"V. Chv\u00e0tal, \u201cOn certain polytopes associated with graphs,\u201dJournal of Combinatorial Theory B 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(86)90156-1","volume":"58","author":"M. Conforti","year":"1986","unstructured":"M. Conforti, D.G. Corneil and A.R. Mahjoub, \u201cK i-covers I: Complexity and polytopes,\u201dDiscrete Mathematics 58 (1986) 121\u2013142.","journal-title":"Discrete Mathematics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","volume":"23","author":"G. Cornu\u00e9jols","year":"1982","unstructured":"G. Cornu\u00e9jols and J.M. Thizy, \u201cSome facets of the simple plant location polytope,\u201dMathematical Programming 23 (1982) 50\u201374.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0121244","volume":"1","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, A.J. Hoffman and R. Oppenheim, \u201cOn balanced matrices,\u201dMathematical Programming Study 1 (1974) 120\u2013132.","journal-title":"Mathematical Programming Study"},{"key":"CR14","volume-title":"\u201cGeneralized resolution and cutting planes,\u201d Research Report n. MSRR 524","author":"J. Hooker","year":"1986","unstructured":"J. Hooker, \u201cGeneralized resolution and cutting planes,\u201d Research Report n. MSRR 524, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986)."},{"key":"CR15","volume-title":"\u201cA generalization of antiwebs to independence systems and their relation to set covering polytopes,\u201d Technical Report","author":"M. Laurent","year":"1987","unstructured":"M. Laurent, \u201cA generalization of antiwebs to independence systems and their relation to set covering polytopes,\u201d Technical Report, CNET PAATIM (Issy les Moulineaux, France, 1987)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G.L. Nemhauser","year":"1974","unstructured":"G.L. Nemhauser and L.E. Trotter, \u201cProperties of vertex packing and independence system polyhedra,\u201dMathematical Programming 6 (1974) 48\u201361.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, \u201cOn the facial structure of set packing polyhedra,\u201dMathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"CR18","unstructured":"A. Sassano, \u201cOn the facial structure of the set covering polytope,\u201d IASI-CNR Report nr. 132 (Rome, 1985)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L.E. Trotter","year":"1975","unstructured":"L.E. Trotter, \u201cA class of facet producing graphs for vertex packing polyhedra,\u201dDiscrete Mathematics 12 (1975) 373\u2013388.","journal-title":"Discrete Mathematics"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF01580383","volume":"11","author":"L.A. Wolsey","year":"1976","unstructured":"L.A. Wolsey, \u201cFurther facet generating procedures for vertex packing polytopes,\u201dMathematical Programming 11 (1976) 158\u2013163.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582277.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582277\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:48Z","timestamp":1556896548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["BF01582277"],"URL":"https:\/\/doi.org\/10.1007\/bf01582277","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}