Parallel Algorithms for Knapsack Type Problems

ISBN-13: 9789810221201 / Angielski / Twarda / 1999 / 216 str.

G. M. Megson; Vassil Alexandrov; V. N. Aleksandrov

Opis

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.