{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:26:07Z","timestamp":1753889167314},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00049-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"217-228","source":"Crossref","is-referenced-by-count":5,"title":["Graph domination, tabu search and the football pool problem"],"prefix":"10.1016","volume":"74","author":[{"given":"Rowan","family":"Davies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon F.","family":"Royle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00049-2_BIB1","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0097-3165(84)90010-4","article-title":"More coverings by rook domains","volume":"36","author":"Blokhuis","year":"1984","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB3","article-title":"Designs, Graphs, Codes and their Links","volume":"Vol. 22","author":"Cameron","year":"1991"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(96)00049-2","article-title":"Tabu search, graph domination and the football pool problem","author":"Davies","year":"1992"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB5","series-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB6","series-title":"Tabu Search","volume":"41","year":"1993"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB7","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0097-3165(91)90024-B","article-title":"Upper bounds for football pool problems and mixed covering codes","volume":"56","author":"H\u00e4m\u00e4l\u00e4inen","year":"1991","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB9","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0097-3165(93)90079-N","article-title":"A new upper bound for the football pool problem for nine matches","volume":"62","author":"Koschnick","year":"1993","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB10","unstructured":"P.R.J. \u00d6sterg\u00e5rd, and H.O. H\u00e4m\u00e4l\u00e4inen, A new table of binary\/ternary mixed covering codes, Preprint."},{"key":"10.1016\/S0166-218X(96)00049-2_BIB11","unstructured":"P.R.J. \u00d6sterg\u00e5rd, Constructing covering codes by tabu search, Preprint."},{"key":"10.1016\/S0166-218X(96)00049-2_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0097-3165(94)90010-8","article-title":"New upper bounds for the football pool problem for 11 and 12 matches","volume":"67","author":"\u00d6sterg\u00e5rd","year":"1994","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB13","article-title":"Theoretical and computational aspects of simulated annealing","volume":"57","author":"van Laarhoven","year":"1988","journal-title":"Centrum voor Wiskunde en Informatica, Tract"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB14","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0097-3165(89)90036-8","article-title":"New upper bounds for the football pool problem for 6, 7 and 8 matches","volume":"52","author":"van Laarhoven","year":"1989","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0166-218X(96)00049-2_BIB15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0097-3165(87)90012-4","article-title":"The football pool problem for 6 matches: a new upper bound obtained by simulated annealing","volume":"45","author":"Wille","year":"1987","journal-title":"J. Combin. Theory, Ser. A"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:50:25Z","timestamp":1556351425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000492"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00049-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}