Parallel Algorithms for Knapsack Type Problems

Parallel Algorithms for Knapsack Type Problems book cover

Parallel Algorithms for Knapsack Type Problems

Author(s): Vassil N Aleksandrov (Author), G M Megson (Author)

  • Publisher: World Scientific Publishing Co Pte Ltd
  • Publication Date: 28 July 1995
  • Language: English
  • Print length: 216 pages
  • ISBN-10: 9810221207
  • ISBN-13: 9789810221201

Book Description

This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.

View on Amazon

电子书代发PDF格式价格30我要求助
未经允许不得转载:Wow! eBook » Parallel Algorithms for Knapsack Type Problems