A computational study of the cutting plane tree algorithm for general mixed-integer linear programs.
Binyuan ChenSimge KüçükyavuzSuvrajeet SenPublished in: Oper. Res. Lett. (2012)
Keyphrases
- cutting plane
- cutting plane algorithm
- computational complexity
- cost function
- learning algorithm
- mixed integer linear programs
- optimal solution
- convex hull
- linear programming
- dynamic programming
- objective function
- np hard
- integer programming
- convergence rate
- knapsack problem
- benchmark problems
- column generation
- special case
- valid inequalities
- search algorithm