Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits.
Create an account for free
Contact
How to shop
Help
Delivery
DPD courier 4.99 €
GLS courier 11.49 €
Shopping guide
My account
▸
Empty :-(
0
Parallel Algorithms For Knapsack Type Problems
Language
English
English
Book
Hardback
This text brings together current research directions in the mapping of dynamic programming problems...
Full description
Libristo code: 05065000
?
277 b
277 b
114.64
€
50 % chance
We search the world
When will I receive my book?
30-day return policy
Customers also purchased
/
Paperback
24.10
€
/
Paperback
23.28
€
/
Paperback
17.11
€
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.
Actress
&
Polyglot
EWA KASP
for
Play video
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.
About the book
Full name
Parallel Algorithms For Knapsack Type Problems
Author
V.N. Aleksandrov, G.M. Megson
Language
English
English
Binding
Book - Hardback
Date of issue
1995
Number of pages
216
EAN
9789810221201
ISBN
9810221207
Libristo code
05065000
Publishers
World Scientific Publishing Co Pte Ltd
Weight
297
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
42.83
€
/
Paperback
14.88
€
/
Hardback
49.62
€
