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.
"synopsis" may belong to another edition of this title.
Search results for Parallel Algorithms for Knapsack Type Problems
Stock Image
Parallel Algorithms for Knapsack Type Problems
Published by
World Scientific Publishing Company, 1999
ISBN 10: 9810221207
ISBN 13: 9789810221201
Used
Hardcover
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. No Jacket. Former library book; Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G9810221207I4N11
Stock Image
Parallel Algorithms for Knapsack Type Problems
Published by
World Scientific Publishing Company, 1999
ISBN 10: 9810221207
ISBN 13: 9789810221201
New
Hardcover
Seller: BOOKWEST, Phoenix, AZ, U.S.A.
Seller rating 4 out of 5 stars
Hardcover. Condition: New. US SELLER SHIPS FAST FROM USA. Seller Inventory # INTOK-132E3-9810221207
Stock Image
Parallel Algorithms for Knapsack Type Problems
Published by
World Scientific Pub Co Inc, 1995
ISBN 10: 9810221207
ISBN 13: 9789810221201
Used
Hardcover
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Hardcover. Condition: Like New. Like NewLIKE NEW. book. Seller Inventory # ERICA83898102212073
Buy Used
US$ 70.27
US$ 33.45 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available