Correction to: 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
- ai planning
- lagrangian relaxation
- column generation
- constraint programming
- cutting plane
- upper bound
- production planning
- network flow
- cutting plane algorithm
- valid inequalities
- integer program
- inference problems
- set covering
- set covering problem
- transportation problem
- special case
- crew scheduling
- network design problem
- vehicle routing problem with time windows
- exact methods
- set partitioning
- dantzig wolfe decomposition
- integer programming formulations