You might also like

Availability alert

More about Parallel Algorithms For Knapsack Type Problems

• Book details
• Synopsis
• Trending among others

You get 264 loyalty points

Book synopsis

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. In particular, it focuses on heuristic and more formal techniques for mapping such problems onto so-called regular parallel architectures. The text is based on papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.

Book details

Book category Books in English Computing & information technology Computer science Computer architecture & logic design

• Full title: Parallel Algorithms For Knapsack Type Problems
• Author: V.N. Aleksandrov, G.M. Megson
• Language: English
• Binding: Hardback
• Number of pages: 216
• EAN: 9789810221201
• ISBN: 9810221207
• ID: 05065000
• Publisher: World Scientific Publishing Co Pte Ltd
• Weight: 297 g
• Date of publishing: 28. July 1995

Trending among others

---

---

---