An initial polyhedral study of the football pool problem

DOI10.1016/J.DISOPT.2026.100946MaRDI QIDQ7310982zbMATH OpenFDO

Authors Javier Marenco, Pablo A. Rey

Publication date 6 August 2026

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2026.100946

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A combinatorial proof for the football pool problem for six matches
• Facets and lifting procedures for the set covering polytope
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3417479 (Why is no real title available?)
• Improved sphere bounds on the covering radius of codes
• Improving bounds on the football pool problem by integer programming and high-throughput computing
• Linear inequalities for covering codes. I. Pair covering inequalities
• Linear inequalities for covering codes. II. Triple covering inequalities
• New lower bounds for binary covering codes
• On the 0,1 facets of the set covering polytope
• On the dominating set polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• One-node cutsets and the dominating set polytope
• Subset Algebra Lift Operators for 0-1 Integer Programming
• The Football Pool Polytope
• The football pool problem for 5 matches

This page was built for publication: An initial polyhedral study of the football pool problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310982)