Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes.
Jesús SáezPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- cutting plane
- linear programming relaxation
- column generation
- integer programming problems
- integer program
- lower bound
- lagrangean relaxation
- linear programming
- valid inequalities
- branch and bound
- cutting plane algorithm
- integer programming
- feasible solution
- set partitioning
- upper bound
- mixed integer programming
- linear program
- knapsack problem
- mixed integer
- lp relaxation
- np hard
- optimal solution
- lagrangian relaxation
- combinatorial optimization
- constraint programming
- branch and bound algorithm
- quadratic programming
- objective function