Knapsack Problems 2004th Edition

ISBN-13: 978-3540402862
ISBN-10: 3540402861
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell?
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Amazon book clubs early access

Join or create book clubs

Choose books together

Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Buy new:
Only 1 left in stock - order soon.
Ships from and sold by
Available at a lower price from other sellers that may not offer free Prime shipping.
FREE delivery: Sep 29 - 30 Details
Fastest delivery: Friday, Sep 25 Details
List Price: $219.99
Save: $59.16 (27%)
19 new from $149.99

Knapsack Problems has been added to your Cart

Available at a lower price from other sellers that may not offer free Prime shipping.

Black lives matter. Books to read right now.
click to open popover

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
    Windows Phone
  • Click here to download from Amazon appstore

To get the free app, enter your mobile phone number.


Special offers and product promotions

Editorial Reviews


From the reviews:

"The book explores the knapsack problem and its variants in 15 chapters … . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject … . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. … In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005)

"This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. … By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. … With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d)

"This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. … With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jürgen Köhler, OR Spectrum, Issue 27, 2005)

"The book starts with a basic introduction to the knapsack problem … . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. … In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem." (K. Šoric, Zentralblatt MATH, Vol. 1103 (5), 2007)

Product details

  • Item Weight : 4.74 pounds
  • Hardcover : 568 pages
  • ISBN-10 : 3540402861
  • ISBN-13 : 978-3540402862
  • Product Dimensions : 6.14 x 1.31 x 9.21 inches
  • Publisher : Springer; 2004th Edition (December 15, 2003)
  • Language: : English