{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:37:25Z","timestamp":1762605445251},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":[[1997,5]]},"DOI":"10.1007\/bf02614623","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:54:01Z","timestamp":1177736041000},"page":"389-421","source":"Crossref","is-referenced-by-count":24,"title":["Wheel inequalities for stable set polytopes"],"prefix":"10.1007","volume":"77","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[]},{"given":"William H.","family":"Cunningham","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02614623_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480190182678","volume":"7","author":"F. Barahona","year":"1994","unstructured":"F. Barahona and A.R. Mahjoub. Compositions of graphs and polyhedra II: stable sets.SIAM Journal on Discrete Mathematics 7 (1994) 359\u2013371.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02614623_CR2","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1137\/S089548019018268X","volume":"7","author":"F. Barahona","year":"1994","unstructured":"F. Barahona and A.R. Mahjoub. Compositions of graphs and polyhedra III: graphs with noW 4 minor.SIAM Journal on Discrete Mathematics 7 (1994) 372\u2013389.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02614623_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (North-Holland, Amsterdam, 1976)."},{"key":"BF02614623_CR4","unstructured":"E. Cheng, Inequalities of wheels with chords for stable set polytopes, Manuscript (1995)."},{"key":"BF02614623_CR5","unstructured":"E. Cheng, Wheel Inequalities for Stable Set Polytopes. Ph.D. Thesis, University of Waterloo (1995)."},{"key":"BF02614623_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-59408-6_42","volume-title":"The 4th Integer Programming and Combinatorial Optimization Conference Proceedings","author":"E. Cheng","year":"1995","unstructured":"E. Cheng and W.H. Cunningham. Separation problems for the stable set polytope. in: E. Balas and J. Clausen, eds.,The 4th Integer Programming and Combinatorial Optimization Conference Proceedings (Springer, Berlin, 1995) 65\u201379."},{"key":"BF02614623_CR7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1090\/dimacs\/026\/19","volume-title":"Cliques Coloring, and Satisfiability","author":"J. Cheriyan","year":"1996","unstructured":"J. Cheriyan, W.H. Cunningham, L. Tun\u00e7el and Y. Wang. A linear programming and rounding approach to max 2-sat, in: D.S. Johnson and M.A. Trick (eds.),Cliques Coloring, and Satisfiability (American Mathematical Society, Providence, RI, 1996) 395\u2013414."},{"key":"BF02614623_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal. Edmonds polytopes and a hierarchy of combinatorial problems.Discrete Mathematics 4 (1973) 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"BF02614623_CR9","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. On certain polytopes associated with graphs.Journal of Combinatorial Theory, Series B 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614623_CR10","unstructured":"W.H. Cunningham, L. Tun\u00e7el and Y. Wang, A polyhedral approach to maximum 2-satisfiability, in preparation."},{"key":"BF02614623_CR11","first-page":"83","volume":"16","author":"J. Fonlupt","year":"1985","unstructured":"J. Fonlupt and J.P. Uhry. Transformations which preserve perfectness andh-perfectness of graphs,Annals of Discrete Mathematics 16 (1985) 83\u201395.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02614623_CR12","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(89)90032-4","volume":"47","author":"A.M.H. Gerards","year":"1989","unstructured":"A.M.H. Gerards, A min-max relation for stable sets in graphs with no odd-K 4.Journal of Combinatorial Theory, Series B 47 (1989) 330\u2013348.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614623_CR13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R. Giles","year":"1981","unstructured":"R. Giles and L.E. Trotter, Jr., On stable set polyhedra forK 13-free graphs,Journal of Combinatorial Theory, Series B 31 (1981) 313\u2013326.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614623_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"BF02614623_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank, Weakly bipartite graphs and the max-cut problem.Operations Research Letters 1 (1981) 23\u201327.","journal-title":"Operations Research Letters"},{"key":"BF02614623_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580723","volume":"40","author":"A.R. Mahjoub","year":"1988","unstructured":"A.R. Mahjoub, On the stable set polytope of a series-parallel graph,Mathematical Programming 40 (1988) 53\u201357.","journal-title":"Mathematical Programming"},{"key":"BF02614623_CR17","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and L.E. Trotter, Jr., Properties of vertex packing and independence system polyhedra,Mathematical Programming 8 (1975) 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"BF02614623_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"BF02614623_CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, On the facial structure of set packing polyhedra,Mathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"BF02614623_CR20","unstructured":"D. Tesch,Disposition von Anruf-Sammehaxis (Deutscher Universit\u00e4ts Verlag, Wiesbaden)."},{"key":"BF02614623_CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L.E. Trotter Jr.","year":"1975","unstructured":"L.E. Trotter, Jr., A class of facet producing graphs for vertex packing polyhedra,Discrete Mathematics 12 (1975) 373\u2013388.","journal-title":"Discrete Mathematics"},{"key":"BF02614623_CR22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF01580383","volume":"11","author":"L.A. Wolsey","year":"1976","unstructured":"L.A. Wolsey, Further facet generating procedures for vertex packing polytopes,Mathematical 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\/BF02614623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614623\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:49:28Z","timestamp":1558342168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["BF02614623"],"URL":"https:\/\/doi.org\/10.1007\/bf02614623","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}