Parallel Algorithms for Knapsack Type Problems - Hardcover

Aleksandrov, Vassil N; Megson, G M

9789810221201: Parallel Algorithms for Knapsack Type Problems

Hardcover

ISBN 10: 9810221207 ISBN 13: 9789810221201

Publisher: World Scientific Publishing Co Pte Ltd, 1995

View all copies of this ISBN edition

1 Used

From � 51

1 New

From � 67.57

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.

"synopsis" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.