Parallel algorithms for knapsack type problems
Auteur :
Megson, G. M.
Éditeur :
Megson, G. M.Aleksandrov, V. N.,
ISBN :
9789810221201
Date de publication :
2 juin 1999
Dimensions :
22,0 cm
Langue :
Anglais
Pays d'origine :
Singapour
This text brings together current research directions in the mapping of dynamic programming problems classified as knapsack type recurrence equations which include: the unbounded knapsack problem; 0/1 knapsack problem; subset sum problem; and change making problem.