Quadratic Knapsack Relaxations Using Cutting Planes.
Christoph HelmbergFranz RendlRobert WeismantelPublished in: IPCO (1996)
Keyphrases
- cutting plane
- knapsack problem
- lower bound
- linear programming relaxation
- upper bound
- np hard
- semidefinite
- cutting plane algorithm
- objective function
- optimal solution
- integer programming
- integer programming problems
- dynamic programming
- linear programming
- branch and bound
- feasible solution
- column generation
- optimization problems
- valid inequalities
- computational complexity
- packing problem
- mixed integer
- integer program
- dantzig wolfe decomposition
- branch and bound algorithm
- greedy algorithm
- linear program
- worst case
- lower and upper bounds
- constraint satisfaction problems
- approximation algorithms
- convex relaxation
- np complete
- scheduling problem
- reinforcement learning