New upper bounds for the football pool problem for 6, 7, and 8 matches

DOI10.1016/0097-3165(89)90036-8zbMath0724.90085OpenAlexW1968946772MaRDI QIDQ2277164

J. H. van Lint, Emile H. L. Aarts, Luc T. Wille, Peter J. M. Van Laarhoven

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/new-upper-bounds-for-the-football-pool-problem-for-6-7-and-8-matches(78da84ab-1ecc-449d-8619-0df7408fb813).html

zbMATH Keywords

upper boundssimulated annealingapproximation algorithmHamming distance

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (16)

New upper bounds for the football pool problem for 11 and 12 matches ⋮ Graph domination, tabu search and the football pool problem ⋮ Jack van Lint (1932--2004): a survey of his scientific work ⋮ Ternary covering codes derived from BCH codes ⋮ The second-order football-pool problem and the optimal rate of generalized-covering codes ⋮ Simulated annealing: A tool for operational research ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ Local search in coding theory ⋮ On lengthening of covering codes ⋮ A new upper bound for the football pool problem for nine matches ⋮ Bounds for binary multiple covering codes ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ Construction of new codes and its related parameters ⋮ A new lower bound for the football pool problem for six matches

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The football pool problem for 7 and 8 matches
• More coverings by rook domains
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• The football pool problem for 5 matches

This page was built for publication: New upper bounds for the football pool problem for 6, 7, and 8 matches