The authors deliver a comprehensive presentation of integer programming. All the problems and algorithms presented in this book are accompanied with relevant theory. In particular the authors present the formulations of the problems, the polyhedral theory, cutting, decomposition and enumeration methods as well as relaxations. Everything is presented in a rigorous way, but on the other hand, the form makes it easy to understand for everyone. Each chapter is followed by the exercises, that allow to recall the contents. For these reasons the book is an essential text in the field of integer programing, that should be recommended as a very useful textbook for students, but also a valuable introduction for the researchers in this area.