Lower Bounds for Cutting Planes Proofs with Small Coefficients.
Maria Luisa BonetToniann PitassiRan RazPublished in: J. Symb. Log. (1997)
Keyphrases
- cutting plane
- lower bound
- upper bound
- cutting plane algorithm
- linear programming relaxation
- branch and bound
- branch and bound algorithm
- objective function
- valid inequalities
- integer programming
- column generation
- integer programming problems
- np hard
- optimal solution
- lower and upper bounds
- integer program
- mixed integer
- lagrangian relaxation
- knapsack problem
- maximum likelihood
- linear programming