Discrete Optimization
- 1st Edition - August 28, 1988
- Imprint: Academic Press
- Authors: R. Gary Parker, Ronald L. Rardin
- Language: English
- Paperback ISBN:9 7 8 - 1 - 4 9 3 3 - 0 7 4 3 - 2
- eBook ISBN:9 7 8 - 1 - 4 8 3 2 - 9 4 8 0 - 3
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.… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteThis 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.
Introduction to Discrete Optimization. Computational Complexity. Polynomial Algorithms-Matroids Enumeration Algorithms. Polynomial Algorithms. Linear Programming Nonpolynomial algorithims-Partial Enumeration Nonpolynomial Algorithims-Polyhedral Description Nonexact Algorithms Vector Matrices and Convex Sets Graph Theory Fundamentals Linear Programming Fundamentals.
- Edition: 1
- Published: August 28, 1988
- No. of pages (eBook): 472
- Imprint: Academic Press
- Language: English
- Paperback ISBN: 9781493307432
- eBook ISBN: 9781483294803
RP
R. Gary Parker
Affiliations and expertise
Georgia Institute of TechnologyRR
Ronald L. Rardin
Affiliations and expertise
Purdue UniversityRead Discrete Optimization on ScienceDirect