Click Here to Download: https://ouo.io/9BgwQg Discrete Optimization By: R. Gary Parker; Ronald L. Rardin Publisher: Academic Press Print ISBN: 9780125450751, 0125450753 eText ISBN: 9781483294803, 1483294803 Copyright year: 1988 Format: PDF Available from $ 165.00 USD SKU 9781483294803 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 chapter.
