| Book Name: | Knapsack Problems |
| Category: | Algorithms |
| Free Download: | Available |
Knapsack Problems: Algorithms and Computer Implementations
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.
Book Description
This book provides a comprehensive overview of methods for solving the knapsack problem (KP), its variants, and generalizations. By presenting various algorithmic methods, the book is also a suitable tool for studying modern algorithms.
This is a recent work on exact and approximate algorithms for a set of important NP-hard problems in the field of integer linear programming, which the authors call “knapsacks”. It includes classic knapsack problems such as Binary, Bounded, Unbounded, and Binary Multiples, as well as lesser-known problems such as Subset-Sum and Change-Making. It also addresses known issues that typically don’t fall into the backpack space, such as common tasks and container packaging. The text fully develops the algorithmic approach without losing its mathematical rigor.
The book begins with a basic introduction to the knapsack problem. A discussion of the basic techniques available to solve this problem follows, making it a useful read for students of computer science, mathematics, and economics. In summary, we can say that this book is a valuable resource not only for students, but also for researchers interested in this issue.
Knapsack Problems: Algorithms and Computer Implementations
Author(s): Silvano Martello, Paolo Toth
Series: Wiley-Interscience Series in Discrete Mathematics and Optimization
Publisher: John Wiley & Sons, Year: 1990
ISBN: 9780471924203,0471924202
knapsack problems algorithms and computer implementations pdf
