Lifting valid inequalities for the precedence constrained knapsack problem.
Robert L. M. J. van de LeenselC. P. M. van HoeselJoris van de KlundertPublished in: Math. Program. (1999)
Keyphrases
- knapsack problem
- valid inequalities
- cutting plane
- facet defining
- linear programming relaxation
- facet defining inequalities
- optimal solution
- integer programming
- np hard
- linear programming
- combinatorial optimization problems
- mixed integer programming
- production planning
- exact algorithms
- optimization problems
- mixed integer
- feasible solution
- traveling salesman problem
- dynamic programming
- column generation
- network design problem
- multidimensional knapsack problem
- linear program
- greedy algorithm
- convex hull
- linear relaxation
- primal dual
- lower and upper bounds
- lagrangian relaxation
- continuous relaxation
- integer program
- lp relaxation
- objective function
- evolutionary algorithm
- cost function
- branch and bound algorithm
- metaheuristic
- special case
- neural network
- computationally expensive
- lower bound
- upper bound