How can discrete optimization problems be solved efficiently using mathematical programming techniques? Harvey M. Salkin provides a comprehensive examination of integer programming, focusing on the theoretical foundations and practical algorithms required to solve problems where variables are restricted to integer values. The text synthesizes various methodologies, including branch and bound, cutting plane methods, and group theoretic approaches, to address complex decision-making scenarios in operations research.

Reader & Expert Consensus: Experts frequently cite this work as a foundational text for understanding the rigorous mathematical underpinnings of integer programming. Readers often note the academic density of the prose, which is intended for advanced students and practitioners in operations research.