Solving 0/1 Knapsack Problem for Light Communication SLA-Based Workflow Mapping Using CUDA.
Dang Minh QuanLaurence Tianruo YangPublished in: CSE (1) (2009)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- optimization problems
- linear relaxation
- dynamic programming
- lp relaxation
- optimal solution
- np hard
- exact algorithms
- linear programming relaxation
- multidimensional knapsack problem
- greedy algorithm
- continuous relaxation
- integer variables
- bicriteria
- inter organizational workflow
- cutting plane
- greedy heuristic
- combinatorial optimization
- business processes
- business process
- quality of service
- service level
- evolutionary algorithm
- objective function