A New Lower Bound for the Football Pool Problem for Six Matches-Reference-Cited by-同舟云学术

A New Lower Bound for the Football Pool Problem for Six Matches

Published:2002-07 Issue:1 Volume:99 Page:175-179
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Östergård Patric R.J.,Wassermann Alfred

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. Lower bounds for q-ary coverings by spheres of radius one;Habsieger;J. Combin. Theory Ser. A,1994

2. The football pool problem for 5 matches;Kamps;J. Combin. Theory,1967

3. New upper bounds for the football pool problem for 6, 7, and 8 matches;van Laarhoven;J. Combin. Theory Ser. A,1989

4. B. D. McKay, nauty User's Guide, version 1.5, Technical Report, TR-CS-90-02, Computer Science Department, Australian National University, 1990.

5. B. D. McKay, autoson—A Distributed Batch System for UNIX Workstation Networks, version 1.3, Technical Report, TR-CS-96-03, Computer Science Department, Australian National University, 1996.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using symmetry to optimize over the Sherali–Adams relaxation;Mathematical Programming Computation;2014-05-04

2. On the minimum size of 4-uniform hypergraphs without propertyB;Discrete Applied Mathematics;2014-01

3. Symmetry in Integer Linear Programming;50 Years of Integer Programming 1958-2008;2009-11-06

4. Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing;INFORMS Journal on Computing;2009-08

5. Bounds for Covering Codes over Large Alphabets;Designs, Codes and Cryptography;2005-10