{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:35:58Z","timestamp":1778571358452,"version":"3.51.4"},"reference-count":18,"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\/bf01589098","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"97-108","source":"Crossref","is-referenced-by-count":28,"title":["A generalization of antiwebs to independence systems and their canonical facets"],"prefix":"10.1007","volume":"45","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1970","unstructured":"C. Berge,Graphs and Hypergraphs (Dunod, Paris, 1970)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cFacets of the knapsack polytope,\u201dMathematical Programming 8 (1975) 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"E. Balas and E. Zemel, \u201cCritical cutsets of graphs and canonical facets of set packing polytopes,\u201dMathematics of Operations Research (1977) 15\u201319.","DOI":"10.1287\/moor.2.1.15"},{"key":"CR4","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 of Applied Mathematics 34 (1978) 119\u2013148.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, \u201cOn certain polytopes associated with graphs,\u201dJournal of Combinatorial Theory (B) 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"M. Conforti and M. Laurent, \u201cOn the facial structure of independence system polyhedra,\u201dMathematics of Operations Research, to appear.","DOI":"10.1287\/moor.13.4.543"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01582277","volume":"43","author":"G. Cornu\u00e9jols","year":"1989","unstructured":"G. Cornu\u00e9jols and A. Sassano, \u201cOn the 0, 1 facets of the set covering polytope,\u201dMathematical Programming 43 (1989) 45\u201355.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm,\u201dMathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, \u201cMatroid intersection,\u201dAnnals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR10","unstructured":"R. Euler, M. Junger and G. Reinelt, \u201cGeneralizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra,\u201d preprint, University of Augsburg."},{"key":"CR11","unstructured":"R. Giles, \u201cSubmodular functions, graphs and integer polyhedra,\u201d Ph.D. thesis, University of Waterloo (1975)."},{"key":"CR12","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":"CR13","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":"CR14","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1975","unstructured":"M.W. Padberg, \u201cA note on zero\u2013one programming,\u201dOperations Research 23 (1975) 833\u2013837.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"A. Sassano, \u201cOn the facial structure of the set covering polytope,\u201dMathematical Programming, to appear.","DOI":"10.1007\/BF01587087"},{"issue":"5","key":"CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0167-6377(83)90032-9","volume":"2","author":"Y. Sekiguchi","year":"1983","unstructured":"Y. Sekiguchi, \u201cA note on node packing problems on hypergraphs,\u201dOperations Research Letters 2(5) (1983) 243\u2013247.","journal-title":"Operations Research Letters"},{"key":"CR17","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":"CR18","volume-title":"Matroid Theory","author":"D. Welsh","year":"1976","unstructured":"D. Welsh,Matroid Theory (Academic Press, New York, 1976)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589098\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589098","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\/BF01589098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589098"],"URL":"https:\/\/doi.org\/10.1007\/bf01589098","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}