Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.
Franklin Djeumou FomeniKonstantinos KaparisAdam N. LetchfordPublished in: Math. Program. (2015)
Keyphrases
- linear programming relaxation
- cutting plane
- lower bound
- integer programming
- knapsack problem
- valid inequalities
- column generation
- linear programming
- integer program
- cutting plane algorithm
- integer programming problems
- branch and bound
- mixed integer programming
- mixed integer
- branch and bound algorithm
- dantzig wolfe decomposition
- np hard
- upper bound
- linear program
- optimal solution