A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.
Antonio FrangioniClaudio GentilePublished in: Oper. Res. Lett. (2009)
Keyphrases
- cutting plane
- integer programming
- cutting plane algorithm
- column generation
- integer programming problems
- lower bound
- linear programming relaxation
- mixed integer
- knapsack problem
- integer program
- valid inequalities
- linear programming
- dantzig wolfe decomposition
- branch and bound
- convex optimization
- lagrangian relaxation
- globally optimal
- linear program
- mixed integer program
- optimal solution
- convex relaxation
- upper bound
- np complete
- graph cuts
- branch and bound algorithm
- constraint programming
- mathematical model