Solving Bi-knapsack Problem Using Tiling Approach for Dynamic Programming.
Benamar Sidi-BoulenouarPublished in: Euro-Par (2001)
Keyphrases
- knapsack problem
- dynamic programming
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- linear relaxation
- exact algorithms
- greedy algorithm
- lp relaxation
- optimization problems
- integer variables
- multidimensional knapsack problem
- linear programming
- np hard problems
- linear programming relaxation
- optimal solution
- business intelligence
- cutting plane
- bicriteria
- heuristic solution
- optimal policy
- greedy heuristic
- combinatorial optimization
- linear program
- continuous relaxation
- genetic algorithm
- convex optimization
- quadratic program
- metaheuristic
- np hard