Improving bounds on the football pool problem by integer programming and high-throughput computing

DOI10.1287/IJOC.1090.0334MaRDI QIDQ2901077zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

branch and boundfootball pool problemhigh-throughput computing

Mathematics Subject Classification ID

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)

Recommendations

• A new lower bound for the football pool problem for six matches
• scientific article; zbMATH DE number 1161255
• An improved upper bound for the football pool problem for nine matches
• A combinatorial proof for the football pool problem for six matches
• Several new lower bounds for football pool systems

Cited in

(16)

• Referee assignment in the Chilean football league using integer programming and patterns
• Integer programming for classifying orthogonal arrays
• On solving a hard quadratic 3-dimensional assignment problem
• New upper bounds for the football pool problem for 11 and 12 matches
• Exploiting symmetries in polyhedral computations
• Orbital shrinking: theory and applications
• Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
• Constraint Orbital Branching
• Equivalence of lattice orbit polytopes
• Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs
• Exploiting symmetry in integer convex optimization using core points
• Solving network design problems via iterative aggregation
• A combinatorial proof for the football pool problem for six matches
• Using symmetry to optimize over the Sherali-Adams relaxation
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• The second-order football-pool problem and the optimal rate of generalized-covering codes

Describes a project that uses

Uses Software

• ALPS
• FATCOP
• HTCondor MW
• Condor-G

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)