Parker R.G., Rardin R.L. Discrete Optimization

Amsterdam: Elsevier, 1988. - 472p.This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.
Several appendixes are included which review the fundamental ideas of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapterCopyright
DedicationIntroduction to Discrete Optimization
Computational Complexity
Polynomial Algorithms—Matroids
Polynomial Algorithms—Linear Programming
Nonpolynomial Algorithms—Partial Enumeration
Nonpolynomial Algorithms—Polyhedral Description
Nonexact Algorithms
Vectors, Matrices and Convex Sets
Graph Theory Fundamentals
Linear Programming Fundamentals