Graph domination, tabu search and the football pool problem Original Research Article

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.