Cover of Aleksandrov Vassil N Aleksandrov, Megson G M Megson: Parallel Algorithms For Knapsack Type Problems

Aleksandrov Vassil N Aleksandrov, Megson G M Megson Parallel Algorithms For Knapsack Type Problems

Price for Eshop: 1003 Kč (€ 40.1)

VAT 0% included

New

E-book delivered electronically online

E-Book information

World Scientific Publishing Company

1999

PDF
How do I buy e-book?

216

978-981-4500-99-9

981-4500-99-2

Annotation

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.

Ask question

You can ask us about this book and we'll send an answer to your e-mail.