Parallel Algorithms for Knapsack Type Problems - Rilegato

Rilegato

ISBN 10: 9810221207 ISBN 13: 9789810221201

Casa editrice: World Scientific Pub Co Inc, 1999

Riassunto

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.

Dettagli dell'edizione

• Editore: World Scientific Pub Co Inc
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 9810221207
• ISBN 13: 9789810221201
• Rilegatura: Copertina rigida
• Numero di pagine: 216
• Redattore: Aleksandrov V. N., Megson G. M.
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile