Generating Fenchel Cutting Planes for Knapsack Polyhedra.
E. Andrew BoydPublished in: SIAM J. Optim. (1993)
Keyphrases
- cutting plane
- knapsack problem
- cutting plane algorithm
- integer programming problems
- integer programming
- lower bound
- column generation
- optimal solution
- dynamic programming
- upper bound
- optimization problems
- multistage stochastic
- np hard
- integer program
- packing problem
- mixed integer
- dantzig wolfe decomposition
- objective function
- valid inequalities
- extreme points
- special case
- high dimensional
- branch and bound
- convex hull
- simulated annealing
- genetic algorithm