Pages that link to "Item:Q2901077"
From MaRDI portal
The following pages link to Improving bounds on the football pool problem by integer programming and high-throughput computing (Q2901077):
Displaying 16 items.
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- New upper bounds for the football pool problem for 11 and 12 matches (Q1331131) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- A combinatorial proof for the football pool problem for six matches (Q1924246) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- Equivalence of Lattice Orbit Polytopes (Q4564021) (← links)
- Referee assignment in the Chilean football league using integer programming and patterns (Q4980000) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- The second-order football-pool problem and the optimal rate of generalized-covering codes (Q6187334) (← links)
- Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs (Q6636522) (← links)