{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:13Z","timestamp":1759847533150},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)80440-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"67-69","source":"Crossref","is-referenced-by-count":6,"title":["Improved solutions to the Steiner triple covering problem"],"prefix":"10.1016","volume":"65","author":[{"given":"Michiel A.","family":"Odijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)80440-1_BIB1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","article-title":"A note on some computationally difficult set covering problems","volume":"18","author":"Avis","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(97)80440-1_BIB3","series-title":"Second Memoir 89","article-title":"Complete classification of triad systems on fifteen elements","volume":"14","author":"Cole","year":"1925"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB4","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\/S0020-0190(97)80440-1_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"J. Global Optimization"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.4153\/CJM-1961-020-3","article-title":"Widths and heights of (0, 1)-matrices","volume":"13","author":"Fulkerson","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(97)80440-1_BIB7","doi-asserted-by":"crossref","first-page":"498","DOI":"10.4153\/CJM-1962-041-9","article-title":"Multiplicities and minimal widths for (0, 1)-matrices","volume":"14","author":"Fulkerson","year":"1962","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(97)80440-1_BIB8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1963-042-1","article-title":"Width sequences for special classes of (0, 1)-matrices","volume":"15","author":"Fulkerson","year":"1963","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(97)80440-1_BIB9","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\/S0020-0190(97)80440-1_BIB10","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB11","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB12","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"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(95)00034-H","article-title":"Solving hard set covering problems","volume":"18","author":"Mannino","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(97)80440-1_BIB14_1","unstructured":"M.G.C. Resende"},{"key":"10.1016\/S0020-0190(97)80440-1_BIB15","series-title":"Proc. 10th Nat. Conf. on Artificial Intelligence (AAAI-92)","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097804401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097804401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:27:11Z","timestamp":1556044031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097804401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097804401"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)80440-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}