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