{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:53:50Z","timestamp":1771329230836,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0167-6377(00)00060-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:28:48Z","timestamp":1027592928000},"page":"63-74","source":"Crossref","is-referenced-by-count":47,"title":["A branch-and-cut algorithm for the maximum cardinality stable set problem"],"prefix":"10.1016","volume":"28","author":[{"given":"F","family":"Rossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(00)00060-2_BIB1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","article-title":"Conflict graphs in integer programming","volume":"121","author":"Atamturk","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB2","doi-asserted-by":"crossref","unstructured":"E. Balas, S. Ceria, G. Cornuejols, G. Pataki, Polyhedral Methods for the Maximum Clique Problem, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 26 (1996).","DOI":"10.1090\/dimacs\/026\/02"},{"key":"10.1016\/S0167-6377(00)00060-2_BIB3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB4","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0167-6377(00)00060-2_BIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480190182678","article-title":"Composition of graphs and polyhedra II: stable sets","volume":"7","author":"Barahona","year":"1994","journal-title":"SIAM J. Discrete Math."},{"issue":"Suppl. 1","key":"10.1016\/S0167-6377(00)00060-2_BIB6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/opre.40.1.S14","article-title":"Habitat dispersion in forest planning and the stable set problem","volume":"40","author":"Barahona","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB7","unstructured":"R. Borndorfer, R. Weismantel, Set packing relaxation of some integer programs, SC97-30 ZIB preprint, 1997."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0166-218X(99)00050-5","article-title":"Separating lifted odd-hole inequalities to solve the index selection problem","volume":"92","author":"Caprara","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-6377(00)00060-2_BIB9","series-title":"Computers and Intractability: a Guide to the Theory of the NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(00)00060-2_BIB10","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"issue":"6","key":"10.1016\/S0167-6377(00)00060-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1287\/mnsc.39.6.657","article-title":"Solving airline crew scheduling by branch and cut","volume":"39","author":"Hoffman","year":"1993","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","article-title":"An exact algorithm for the maximum stable set problem","volume":"3","author":"Mannino","year":"1994","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB13","first-page":"249","article-title":"Edge projection and the maximum cardinality stable set problem","volume":"26","author":"Mannino","year":"1996","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/S0167-6377(00)00060-2_BIB14","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nehmauser","year":"1982","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB15","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0377-2217(00)00064-3","article-title":"A set packing model for the ground-holding problem in congested networks","volume":"131","author":"Rossi","year":"2001","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/S0167-6377(00)00060-2_BIB16","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","article-title":"A branch and bound algorithm for the stability number of a sparse graph","volume":"10","author":"Sewell","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0167-6377(00)00060-2_BIB17","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF01580383","article-title":"Further facet generating procedures for vertex packing polytopes","volume":"11","author":"Wolsey","year":"1979","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:09:21Z","timestamp":1578546561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637700000602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0167637700000602"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(00)00060-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}