\input zb-basic
\input zb-ioport
\iteman{io-port 06060439}
\itemau{Linderoth, Jeff; Margot, Fran\c{c}ois; Thain, Greg}
\itemti{Improving bounds on the football pool problem by integer programming and high-throughput computing.}
\itemso{INFORMS J. Comput. 21, No. 3, 445-457 (2009).}
\itemab
Summary: The football pool problem, which gets its name from a lottery-type game where participants predict the outcome of soccer matches, is to determine the smallest covering code of radius 1 of ternary words of length $v$. For $v = 6$, the optimal solution is not known. Using a combination of isomorphism pruning, subcode enumeration, and linear programming-based bounding, running on a high-throughput computational grid consisting of thousands of processors, we are able to improve the lower bound on the size of the optimal code from 65 to 71.
\itemrv{~}
\itemcc{}
\itemut{football pool problem; high-throughput computing; branch and bound}
\itemli{doi:10.1287/ijoc.1090.0334}
\end