Graph domination, tabu search and the football pool problem
From MaRDI portal
(Redirected from Publication:1356502)
Applications of mathematical programming (90C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Theory of error-correcting codes and error-detecting codes (94B99)
Recommendations
Cites work
- scientific article; zbMATH DE number 4079162 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1229706 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- A new table of binary/ternary mixed covering codes
- A new upper bound for the football pool problem for nine matches
- A user's guide to tabu search
- Graph domination, tabu search and the football pool problem
- More coverings by rook domains
- New upper bounds for the football pool problem for 11 and 12 matches
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- Upper bounds for football pool problems and mixed covering codes
Cited in
(2)
This page was built for publication: Graph domination, tabu search and the football pool problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356502)