Graph domination, tabu search and the football pool problem
From MaRDI portal
Publication:1356502
DOI10.1016/S0166-218X(96)00049-2zbMath0884.90125MaRDI QIDQ1356502
Publication date: 5 April 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Extremal problems in graph theory (05C35) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for football pool problems and mixed covering codes
- More coverings by rook domains
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- A new upper bound for the football pool problem for nine matches
- New upper bounds for the football pool problem for 11 and 12 matches
- Graph domination, tabu search and the football pool problem
- A new table of binary/ternary mixed covering codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- A user's guide to tabu search
This page was built for publication: Graph domination, tabu search and the football pool problem