Lower bounds on the sizes of integer programs without additional variables.
Volker KaibelStefan WeltgePublished in: Math. Program. (2015)
Keyphrases
- integer program
- lower bound
- cutting plane
- column generation
- linear programming relaxation
- branch and bound
- upper bound
- linear program
- multistage stochastic
- integer programming
- objective function
- branch and bound algorithm
- np hard
- optimal solution
- linear programming
- random variables
- network flow
- valid inequalities
- knapsack problem
- vc dimension
- lower and upper bounds
- search space
- stochastic programming
- genetic algorithm