Improving bounds on the football pool problem by integer programming and high-throughput computing
DOI10.1287/IJOC.1090.0334zbMATH Open1243.90006OpenAlexW2014849651MaRDI QIDQ2901077FDOQ2901077
Authors: Jeff Linderoth, François Margot, Greg Thain 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ea74cf1a3f599c3789b526311cc9ac1302cec53f
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (16)
- Exploiting symmetries in polyhedral computations
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- A combinatorial proof for the football pool problem for six matches
- On solving a hard quadratic 3-dimensional assignment problem
- Referee assignment in the Chilean football league using integer programming and patterns
- Orbital shrinking: theory and applications
- Equivalence of lattice orbit polytopes
- Integer programming for classifying orthogonal arrays
- Exploiting symmetry in integer convex optimization using core points
- Constraint Orbital Branching
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- The second-order football-pool problem and the optimal rate of generalized-covering codes
- Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs
- New upper bounds for the football pool problem for 11 and 12 matches
- Using symmetry to optimize over the Sherali-Adams relaxation
- Solving network design problems via iterative aggregation
Uses Software
This page was built for publication: Improving bounds on the football pool problem by integer programming and high-throughput computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901077)
