Knapsack Problems: Algorithms and Computer

Review of the book
The purpose of this book is to develop an algorithmic approach for all kinds of knapsack problems. For each type of knapsack problem, we first deal with modeling the problem and how to calculate the bounds of the problem using relaxation. Then, we present the order of solutions based on branch and boundary approaches, dynamic programming and approximate algorithms. Analyzing the difficulty of the algorithm in the worst case will be another part of the problem analysis. To find the optimal solution, we program the presented algorithms with the Fortran program. In programming, it is tried that the desired complete code can be followed and developed.

Table of Contents
The content presented in this book is as follows:
1. Introduction the knapsack problem
2. Zero and one knapsack problem and presenting different solutions
3. The limited knapsack problem and presenting various solutions
4. Subset-sum problem and presenting different solutions
5. The problem of change-making and presenting various solutions
6. The problem of multiple knapsack and presenting a solution
7. General knapsack problem and presenting a solution
8. bin-packing problem and providing a solution
9. Code of computer programs to solve all kinds of knapsack problem