N-fold integer programming.
Jesús A. De LoeraRaymond HemmeckeShmuel OnnRobert WeismantelPublished in: Discret. Optim. (2008)
Keyphrases
- integer programming
- linear programming
- np hard
- constraint programming
- facility location
- column generation
- production planning
- cutting plane
- lagrangian relaxation
- valid inequalities
- set covering problem
- ai planning
- set covering
- network flow
- integer program
- dantzig wolfe decomposition
- cutting plane algorithm
- inference problems
- vehicle routing problem with time windows
- transportation problem
- linear programming relaxation
- crew scheduling
- logistic regression
- round robin tournament
- upper bound