Lower bounds for cutting planes proofs with small coefficients.
Maria Luisa BonetToniann PitassiRan RazPublished in: STOC (1995)
Keyphrases
- cutting plane
- lower bound
- upper bound
- integer programming problems
- cutting plane algorithm
- objective function
- branch and bound algorithm
- integer programming
- linear programming relaxation
- lower and upper bounds
- branch and bound
- valid inequalities
- optimal solution
- np hard
- column generation
- dantzig wolfe decomposition
- mixed integer
- knapsack problem
- genetic algorithm
- integer program
- constraint satisfaction problems
- linear programming
- artificial bee colony algorithm