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

DOI10.1016/0097-3165(89)90036-8MaRDI QIDQ2277164zbMATH OpenOpenAlexFDO

Authors E. Aarts, Jack van Lint, Peter J. M. Van Laarhoven, Luc T. Wille

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

approximation algorithmHamming distancesimulated annealingupper bounds

Mathematics Subject Classification ID

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) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• Lower bounds for the football pool problem for 7 and 8 matches
• A new lower bound for the football pool problem for six matches
• A new lower bound for the football pool problem for 7 matches
• New upper bounds for the football pool problem for 11 and 12 matches
• A new upper bound for the football pool problem for nine matches
• An improved upper bound for the football pool problem for nine matches
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Several new lower bounds for football pool systems
• A combinatorial proof for the football pool problem for six matches
• Upper bounds for football pool problems and mixed covering codes

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• More coverings by rook domains
• Optimization by simulated annealing
• The football pool problem for 5 matches
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• The football pool problem for 7 and 8 matches

Cited in

(18)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277164)