The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool.
Arnaud FrévilleGérard PlateauPublished in: J. Heuristics (1996)
Keyphrases
- knapsack problem
- high level
- optimal solution
- low level
- combinatorial optimization problems
- test problems
- optimization problems
- np hard
- exact algorithms
- higher level
- multidimensional knapsack problem
- heuristic solution
- dynamic programming
- bicriteria
- np hard problems
- lower level
- multiple objectives
- greedy algorithm
- greedy heuristic
- continuous relaxation
- implicit enumeration
- maximum profit
- integer programming
- computational complexity
- objective function