A Distributed Algorithm for 0-1 Knapsack Problem Based on Mobile Agent.
Shanping QiaoShixian WangYongzheng LinLing ZhaoPublished in: ISDA (2) (2008)
Keyphrases
- knapsack problem
- mobile agents
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- np hard
- worst case
- exact algorithms
- greedy heuristic
- linear programming relaxation
- cost function
- multi agent
- bicriteria
- agent technology
- load balancing
- optimization problems
- simulated annealing
- special case
- search space
- cooperative
- greedy algorithm
- fault tolerance
- client server
- computing environments
- distributed computing
- implicit enumeration