Includes bibliographical references and index.

"An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. Contains a new chapter on Benders' algorithm, as there have been many successful applications of Benders' algorithm since the first edition published. Provides improved presentation of Branch-and-Price Algorithms. Contains an introduction to Branch-Cut and Price. Includes new heuristics within mixed integer programming (MIP) codes and user implemented heuristics using a Modelling Language and a MIP solver . Supplementary material consists of solutions to some exercises, available to instructors on a Wiley Instructor Companion Site""-- Provided by publisher."