Graph domination, tabu search and the football pool problem

Discrete Applied Mathematics

Volumn 74, Issue 3, 1997, Pages 217-228

  Davies, Rowan ^a   Royle, Gordon F ^b  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040510446     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00049-2     Document Type: Article

References (15)

1. N. Biggs, Algebraic Graph Theory (Cambridge University Press, Cambridge, 1974).
2. A. Blokhuis and C.W.H. Lam, More coverings by rook domains, J. Combin. Theory, Ser. A 36 (1984) 240-244.
3. P.J. Cameron, and J.H. van Lint, Designs, Graphs. Codes and their Links. London Mathematical Society Student Texts, Vol. 22 (Cambridge University Press. Cambridge, 1991).
4. R. Davies,Tabu search, graph domination and the football pool problem, Honours Thesis, Department of Computer Science, University of Western Australia, 1992.
5. M. Garey, and D. Johnson, Computers and Intractability: a guide to the theory of NP-completeness. (W.H. Freeman. San Francisco, 1979).
6. F. Glover, et al., eds., Tabu Search, Ann. Oper. Res., 41 (1993).
7. F. Glover, and M. Laguna, Tabu search, in: ed., C. Reeves, Modern Heuristic Techniques for Combinatorial Problems (Halsted Press. New York, 1993).
8. H. Hämäläinen, and S. Rankinen, Upper bounds for football pool problems and mixed covering codes, J. Combin. Theory. Ser. A 56 (1991) 84-95.
9. K.U. Koschnick, A new upper bound for the football pool problem for nine matches, J. Combin. Theory. Ser. A 62 (1993) 162-167.
10. P.R.J. Östergård, and H.O. Hämäläinen, A new table of binary/ternary mixed covering codes, Preprint.
11. P.R.J. Östergård, Constructing covering codes by tabu search, Preprint.
12. P.R.J. Östergård, New upper bounds for the football pool problem for 11 and 12 matches, J. Combin. Theory, Ser. A 67 (1994) 161-168.
13. P.J.M. van Laarhoven, Theoretical and computational aspects of simulated annealing, Centrum voor Wiskunde en Informatica, Tract 57 (1988).
14. P.J.M. van Laarhoven, E.H.L. Aarts, J.H. van Lint, and L.T. Wille, New upper bounds for the football pool problem for 6,7 and 8 matches. J. Combin. Theory, Ser. A 52 (1989) 304-312.
15. L.T. Wille, The football pool problem for 6 matches: a new upper bound obtained by simulated annealing, J. Combin. Theory, Ser. A 45 (1987) 171-177.