Integer Programming Laurence A. Wolsey

Review of the book
This book is prepared for undergraduate and graduate courses in operations research, mathematics, engineering, and computer science. This book will tell the reader why some integer problems are difficult to solve and how to rewrite them to drastically reduce the solution time. This book is written as a self-study and it is recommended that the reader is familiar with the concepts of linear programming.

Table of Contents
The contents discussed in this book are as follows
1- Formulation of integer programming problems
2- Calculation of limits, release and optimality in integer programming
3- Presentation of well-known integer programming problems and efficient algorithms for them
4- Allocation and matching problem
5- The problem of dynamic planning
6- Complexity of issues
7- Branch and edge method
8- Cutting plane method
9- Strong valid inequalities
10- Lagrange relaxation and duality
11- Column generation algorithms
12- Heuristics