Graph domination, tabu search and the football pool problem
DOI10.1016/S0166-218X(96)00049-2zbMATH Open0884.90125MaRDI QIDQ1356502FDOQ1356502
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
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)
Cites Work
- A user's guide to tabu search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new table of binary/ternary mixed covering codes
- Upper bounds for football pool problems and mixed covering codes
- Title not available (Why is that?)
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- More coverings by rook domains
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- Title not available (Why is that?)
- 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
Cited In (2)
Uses Software
Recommendations
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)
