n-Fold integer programming in cubic time.
Raymond HemmeckeShmuel OnnLyubov RomanchukPublished in: Math. Program. (2013)
Keyphrases
- integer programming
- production planning
- np hard
- linear programming
- constraint programming
- ai planning
- column generation
- cutting plane
- valid inequalities
- network flow
- set covering
- integer program
- lagrangian relaxation
- b spline
- set covering problem
- transportation problem
- cutting plane algorithm
- facility location
- inference problems
- crew scheduling
- integer programming formulations
- linear programming relaxation
- np complete
- set partitioning
- computational complexity
- search algorithm