Integer Programming Subject to Monomial Constraints.
Christoph BuchheimDennis MichaelsRobert WeismantelPublished in: SIAM J. Optim. (2010)
Keyphrases
- integer programming
- constraint programming
- integer program
- valid inequalities
- round robin tournament
- global constraints
- np hard
- integer programming formulations
- linear programming
- cutting plane
- column generation
- lagrangian relaxation
- ai planning
- network flow
- set covering problem
- transportation problem
- constraint satisfaction
- inference problems
- set covering
- linear programming relaxation
- crew scheduling
- constraint satisfaction problems
- production planning
- dantzig wolfe decomposition
- optimal solution
- cutting plane algorithm
- vehicle routing problem with time windows
- facility location
- decomposition methods