Lower Time Bounds for Integer Programming with Two Variables.
Clemens LautemannFriedhelm Meyer auf der HeidePublished in: Inf. Process. Lett. (1985)
Keyphrases
- integer programming
- np hard
- lower bound
- linear programming
- constraint programming
- cutting plane
- column generation
- production planning
- integer program
- network flow
- set covering problem
- ai planning
- lagrangian relaxation
- upper bound
- valid inequalities
- set covering
- vehicle routing problem with time windows
- linear relaxation
- worst case
- linear programming relaxation
- set partitioning
- cutting plane algorithm
- inference problems
- facility location
- integer programming formulations
- transportation problem
- random variables
- constraint satisfaction
- state space
- network design problem
- np complete