Bounding the final rank during a round robin tournament with integer programming.
Uwe GotzesKai HoppmannPublished in: Oper. Res. (2022)
Keyphrases
- round robin tournament
- integer programming
- np hard
- linear programming
- column generation
- network flow
- cutting plane
- constraint programming
- ai planning
- lagrangian relaxation
- production planning
- upper bound
- facility location
- set covering
- set covering problem
- valid inequalities
- transportation problem
- inference problems
- vehicle routing problem with time windows
- lower bound
- network design problem
- cutting plane algorithm
- special case