{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:43Z","timestamp":1781345743407,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"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":[[1995,8]]},"DOI":"10.1016\/0167-6377(95)00034-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"1-5","source":"Crossref","is-referenced-by-count":29,"title":["Solving hard set covering problems"],"prefix":"10.1016","volume":"18","author":[{"given":"Carlo","family":"Mannino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00034-H_BIB1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","article-title":"A note on some computationally difficult set covering problems","volume":"8","author":"Avis","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00034-H_BIB2","first-page":"207","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"34","author":"Babel","year":"1990","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0167-6377(95)00034-H_BIB3","first-page":"15213","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","author":"Balas","year":"1994"},{"key":"10.1016\/0167-6377(95)00034-H_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0167-6377(95)00034-H_BIB5","doi-asserted-by":"crossref","DOI":"10.21236\/ADA275328","article-title":"Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring","author":"Balas","year":"1993"},{"key":"10.1016\/0167-6377(95)00034-H_BIB6","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(95)00034-H_BIB7","article-title":"Computational advances in the solution of large-scale set covering and set partitioning problems","author":"Bausch","year":"1982"},{"key":"10.1016\/0167-6377(95)00034-H_BIB8","article-title":"Enhancing an algorithm for set covering problems","author":"Beasley","year":"1990"},{"key":"10.1016\/0167-6377(95)00034-H_BIB9","article-title":"A combinatorial column generation algorithm for the maximum clique and stable set problem","author":"Bourjolly","year":"1994"},{"key":"10.1016\/0167-6377(95)00034-H_BIB10","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1057\/jors.1992.74","article-title":"Solution of set-covering and setpartitioning problems using assignment relaxations","volume":"5","author":"El-Darzi","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(95)00034-H_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(95)00034-H_BIB12","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","article-title":"Optimal solution of set covering\/partitioning problems using dual heuristics","volume":"36","author":"Fisher","year":"1990","journal-title":"Manage. Sci."},{"key":"10.1016\/0167-6377(95)00034-H_BIB13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","article-title":"Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems","volume":"2","author":"Fulkerson","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/0167-6377(95)00034-H_BIB14","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(95)00034-H_BIB15","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"issue":"3","key":"10.1016\/0167-6377(95)00034-H_BIB16","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","article-title":"An interior point algorithm to solve computationally difficult set covering problems","volume":"52","author":"Karmarkar","year":"1991","journal-title":"Math. Programming (B)"},{"key":"10.1016\/0167-6377(95)00034-H_BIB17","unstructured":"C. Mannino and A. Sassano, \u201cEdge projection and the maximum stable set problem\u201d, to appear in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science."},{"key":"10.1016\/0167-6377(95)00034-H_BIB18","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":"J. Comput. Optim. Appl."},{"issue":"5","key":"10.1016\/0167-6377(95)00034-H_BIB19","doi-asserted-by":"crossref","first-page":"443","DOI":"10.2307\/2583564","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(95)00034-H_BIB20","unstructured":"E.C. Sewell, \u201cA branch and bound algorithm for the stability number of a sparse graph\u201d, to appear in ORSA J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500034H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500034H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:34Z","timestamp":1555577614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779500034H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["016763779500034H"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00034-h","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}