Approximating the Orthogonal Knapsack Problem for Hypercubes.
Rolf HarrenPublished in: ICALP (1) (2006)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- exact algorithms
- dynamic programming
- test problems
- optimization problems
- multidimensional knapsack problem
- greedy algorithm
- linear programming relaxation
- np hard
- bicriteria
- np hard problems
- continuous relaxation
- multiple objectives
- neural network
- greedy heuristic
- heuristic solution
- maximum profit
- implicit enumeration
- scheduling problem
- upper bound
- metaheuristic
- particle swarm optimization
- linear programming