N-fold integer programming via LP rounding.
Jana CslovjecsekFriedrich EisenbrandRobert WeismantelPublished in: CoRR (2020)
Keyphrases
- integer programming
- linear programming
- linear programming relaxation
- linear program
- np hard
- valid inequalities
- feasible solution
- production planning
- column generation
- lp relaxation
- set covering
- approximation algorithms
- network flow
- optimal solution
- facility location
- primal dual
- dynamic programming
- mixed integer
- lagrangian relaxation
- ai planning
- inference problems
- cutting plane algorithm
- cutting plane
- objective function
- constraint programming
- set covering problem
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- round robin tournament