论文信息 - Graph Domination, Tabu Search and the Football Pool Problem

Graph Domination, Tabu Search and the Football Pool Problem

Abstract We describe the use of a tabu search algorithm for generating near minimum dominating sets in graphs. We demonstrate the effectiveness of this algorithm by considering a previously studied class of graphs, the so-called “football pool” graphs, and improving many of the known upper bounds for this class.

Gordon F. Royle | Rowan Davies | G. Royle | Rowan Davies

[1] Patric R. J. Östergård,et al. Constructing covering codes by tabu search , 1997 .

[2] P.J.M. van Laarhoven,et al. Theoretical and Computational Aspects of Simulated Annealing. , 1990 .

[3] Patric R. J. Östergård,et al. A New Table of Binary/Ternary Mixed Covering Codes , 1997, Des. Codes Cryptogr..

[4] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .

[5] Patric R. J. Östergård,et al. New Upper Bounds for the Football Pool Problem for 11 and 12 Matches , 1994, J. Comb. Theory, Ser. A.

[6] Emile H. L. Aarts,et al. New upper bounds for the football pool problem for 6, 7, and 8 matches , 1989, J. Comb. Theory, Ser. A.

[7] L. T. Wille. The football pool problem for 6 matches: A new upper bound obtained by simulated annealing , 1987, J. Comb. Theory, Ser. A.

[8] Klaus-Uwe Koschnick. A new upper bound for the football pool problem for nine matches , 1993 .

[9] Clement W. H. Lam,et al. More Coverings by Rook Domains , 1984, J. Comb. Theory, Ser. A.

[10] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12] Heikki Hämäläinen,et al. Upper bounds for football pool problems and mixed covering codes , 1991, J. Comb. Theory, Ser. A.

[13] Peter J. Cameron,et al. Designs, graphs, codes, and their links , 1991 .