Polyhedral Results for the Precedence-Constrained Knapsack Problem.
E. Andrew BoydPublished in: Discret. Appl. Math. (1993)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- multidimensional knapsack problem
- dynamic programming
- np hard
- test problems
- exact algorithms
- convex hull
- np hard problems
- greedy algorithm
- bicriteria
- heuristic solution
- convex sets
- cutting plane
- integer variables
- line drawings
- neural network
- greedy heuristic
- implicit enumeration
- continuous relaxation
- integer programming
- multiple objectives
- linear programming relaxation