Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
From MaRDI portal
Publication:2901077
DOI10.1287/ijoc.1090.0334zbMath1243.90006OpenAlexW2014849651MaRDI QIDQ2901077
Margot, François, Greg Thain, Jeff Linderoth
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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (12)
Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ Equivalence of Lattice Orbit Polytopes ⋮ Constraint Orbital Branching ⋮ The second-order football-pool problem and the optimal rate of generalized-covering codes ⋮ On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ Exploiting symmetry in integer convex optimization using core points ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ Integer Programming for Classifying Orthogonal Arrays ⋮ Orbital shrinking: theory and applications ⋮ Solving network design problems via iterative aggregation ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ Exploiting Symmetries in Polyhedral Computations
Uses Software
This page was built for publication: Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
