Parallel Algorithms for Knapsack Type Problems - Couverture rigide

Aleksandrov, Vassil N; Megson, G M

 
9789810221201: Parallel Algorithms for Knapsack Type Problems

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.