The book "Knapsack Problems" offers a comprehensive analysis and discussion of the various aspects of the knapsack problem, which is of great significance in mathematics and computer science. It covers both the fundamental concepts and the latest developments in this research area. The authors, Hans Kellerer, Ulrich Pferschy, and David Pisinger, present a variety of approaches, including exact algorithms, heuristics, and approximation methods. Furthermore, the knapsack problem is examined in higher dimensions as well as in various variations that are relevant in practice. This monograph is the result of intensive research and provides deep insights into the entire family of knapsack problems, including related issues such as the subset-sum problem and both bounded and unbounded knapsack problems. The structured approach and detailed treatment of the topics make this book a valuable resource for students and professionals dealing with optimization problems.