Continuous cutting plane algorithms in integer programming.
Didier ChételatAndrea LodiPublished in: Oper. Res. Lett. (2023)
Keyphrases
- cutting plane
- integer programming
- cutting plane algorithm
- column generation
- np hard
- integer program
- lower bound
- linear programming
- constraint programming
- set covering problem
- vehicle routing problem with time windows
- valid inequalities
- worst case
- set covering
- network flow
- lagrangian relaxation
- production planning
- special case
- mixed integer
- state space
- learning algorithm
- approximation algorithms
- upper bound