{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:59:18Z","timestamp":1776329958694,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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,8]]},"DOI":"10.1007\/bf01589100","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"111-137","source":"Crossref","is-referenced-by-count":37,"title":["Facets and lifting procedures for the set covering polytope"],"prefix":"10.1007","volume":"45","author":[{"given":"Paolo","family":"Nobili","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","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cFacets of the knapscak polytope,\u201dMathematical Programming 8 (1975) 146\u2013164.","journal-title":"Mathematical Programming"},{"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","volume-title":"\u201cOn the set covering polytope: I. All the facets with coefficients in {0, 1, 2},\u201d Management Science Research Report n. MSRR-522","author":"E. Balas","year":"1986","unstructured":"E. Balas and S.M. Ng, \u201cOn the set covering polytope: I. All the facets with coefficients in {0, 1, 2},\u201d Management Science Research Report n. MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel, \u201cFacets of the knapsack polytope from minimal covers,\u201dSIAM Journal on Applied Mathematics 34 (1978) 119\u2013148.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR6","volume-title":"\u201cA computational survey of methods for the set covering problem,\u201d Report 73\/2","author":"N. Christofides","year":"1973","unstructured":"N. Christofides and S. Korman, \u201cA computational survey of methods for the set covering problem,\u201d Report 73\/2, Imperial College of Science and Technology (London, 1973)."},{"key":"CR7","volume-title":"On the facial structure of independence systems polyhedra","author":"M. Conforti","year":"1986","unstructured":"M. Conforti and M. Laurent, \u201cOn the facial structure of independence systems polyhedra,\u201d preprint New York University (New York, NY, 1986)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01582277","volume":"43","author":"G. Cornuejols","year":"1989","unstructured":"G. Cornuejols and A. Sassano, \u201cOn the 0, 1 facets of the set covering polytope,\u201dMathematical Programming, 43 (1989) 45\u201355.","journal-title":"Mathematical Programming"},{"key":"CR9","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.L. Johnson and M.W. Padberg, \u201cSolving large-scale zero\u2013one linear programming problems,\u201dOperations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"CR10","volume-title":"\u201cGeneralization of cliques, odd cycles and anticyles and their relation to independence system polyhedra,\u201d Preprint n. 16","author":"R. Euler","year":"1984","unstructured":"R. Euler, M. J\u00fcnger and G. Reinelt, \u201cGeneralization of cliques, odd cycles and anticyles and their relation to independence system polyhedra,\u201d Preprint n. 16, Matematisches Institut Universit\u00e4t Augsburg (Augsburg, 1984)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, G.L. Nemhauser and L.E. Trotter, \u201cTwo computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems,\u201dMathematical Programming Study 2 (1974) 72\u201381.","journal-title":"Mathematical Programming Study"},{"key":"CR12","volume-title":"\u201cFacets of the knapsack polytope derived from disjoint and overlapping index configurations,\u201d Technical Report","author":"E.S. Gottlieb","year":"1987","unstructured":"E.S. Gottlieb and M.R. Rao, \u201cFacets of the knapsack polytope derived from disjoint and overlapping index configurations,\u201d Technical Report, New York University (New York, NY, 1987)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"53","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOn the acyclic subgraph polytope,\u201dMathematical Programming 53 (1985) 28\u201342.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cA cutting plane algorithm for the linear ordering problem,\u201dOperations Research 32 (1984) 1195\u20131220.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01589098","volume":"45","author":"M. Laurent","year":"1989","unstructured":"M. Laurent, \u201cA generalization of antiwebs to independence systems and their canonical facets,\u201dMathematical Programming 45 (1989) 97\u2013108, this issue.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.19.4.998","volume":"19","author":"C.E. Lemke","year":"1971","unstructured":"C.E. Lemke, H.M. Salkin and K. Spielberg, \u201cSet covering by single-branch enumeration with linear programming subproblems,\u201dOperations Research 19 (1971) 998\u20131022.","journal-title":"Operations Research"},{"key":"CR17","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":"CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M.W. Padberg","year":"1979","unstructured":"M.W. Padberg, \u201cCovering, packing and knapsack problems,\u201dAnnals of Discrete Mathematics 4 (1979) 265\u2013287.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M.W. Padberg","year":"1980","unstructured":"M.W. Padberg, \u201c(1,k)-Configurations and facets for packing problems,\u201dMathematical Programming 18 (1980) 94\u201399.","journal-title":"Mathematical Programming"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0167-5060(08)70751-9","volume":"1","author":"U. Peled","year":"1977","unstructured":"U. Peled, \u201cProperties of the facets of binary polytopes,\u201dAnnals of Discrete Mathematics 1 (1977) 435\u2013456.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"A. Sassano","year":"1989","unstructured":"A. Sassano, \u201cOn the facial structure of the set covering polytope,\u201dMathematical Programming 44 (1989) 181\u2013202.","journal-title":"Mathematical Programming"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0167-6377(83)90032-9","volume":"5","author":"Y. Sekiguchi","year":"1983","unstructured":"Y. Sekiguchi, \u201cA note on node packing polytopes on hypergraphs,\u201dOperations Research Letters 5 (1983) 243\u2013247.","journal-title":"Operations Research Letters"},{"key":"CR23","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":"CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"L.A. Wolsey, \u201cFaces for a linear inequality in 0\u20131 variables,\u201dMathematical Programming 8 (1975) 165\u2013178.","journal-title":"Mathematical Programming"},{"key":"CR25","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"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"E. Zemel, \u201cLifting the facets of zero\u2013one polytopes,\u201dMathematical Programming 15 (1978) 268\u2013277.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589100.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589100\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:31Z","timestamp":1556897791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589100"],"URL":"https:\/\/doi.org\/10.1007\/bf01589100","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}