Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs.
Merve BodurAlberto Del PiaSantanu S. DeyMarco S. MolinaroPublished in: SIAM J. Optim. (2019)
Keyphrases
- integer program
- lower bound
- cutting plane
- linear programming relaxation
- column generation
- branch and bound
- integer programming
- upper bound
- linear program
- multistage stochastic
- np hard
- packing problem
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- lattice structure
- lagrangian relaxation
- worst case
- vc dimension
- network flow
- objective function
- valid inequalities
- cost function
- special case