Complexity of linear relaxations in integer programming.
Gennadiy AverkovMatthias SchymuraPublished in: Math. Program. (2022)
Keyphrases
- integer programming
- np hard
- linear programming
- linear programming relaxation
- worst case
- production planning
- ai planning
- facility location
- computational complexity
- lower bound
- semidefinite
- cutting plane
- network flow
- transportation problem
- constraint programming
- column generation
- set covering
- set covering problem
- integer program
- branch and bound algorithm
- special case
- vehicle routing problem with time windows
- cutting plane algorithm
- lagrangian relaxation
- reinforcement learning
- valid inequalities
- linear program
- lp relaxation
- optimal solution
- inference problems
- dantzig wolfe decomposition
- quadratic programming
- linear model
- approximation algorithms