Lower Bounds on the Sizes of Integer Programs without Additional Variables.
Volker KaibelStefan WeltgePublished in: IPCO (2014)
Keyphrases
- integer program
- lower bound
- cutting plane
- column generation
- branch and bound
- linear programming relaxation
- linear program
- upper bound
- multistage stochastic
- integer programming
- branch and bound algorithm
- objective function
- np hard
- linear programming
- optimal solution
- random variables
- worst case
- lagrangian relaxation
- soft constraints
- valid inequalities
- np complete
- network flow
- special case
- search algorithm