Knapsack Problems: Algorithms and Computer Implementations

This book provides a comprehensive overview of the methods for solving Knapsack Problems (KP), its variants and generalizations. By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms.

Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes not only the classical knapsack problems such as binary, bounded, unbounded or binary multiple, but also less familiar problems such as subset-sum and change-making.

Well known problems that are not usually classified in the knapsack area, including generalized assignment and bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor.

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.