N-fold integer programming in cubic time
Raymond HemmeckeShmuel OnnLyubov RomanchukPublished in: CoRR (2011)
Keyphrases
- integer programming
- np hard
- linear programming
- network flow
- constraint programming
- column generation
- ai planning
- b spline
- lagrangian relaxation
- set covering problem
- facility location
- cutting plane algorithm
- production planning
- integer program
- cutting plane
- inference problems
- valid inequalities
- crew scheduling
- transportation problem
- layout design
- integer programming formulations
- network design problem
- set covering