 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Discrete Optimization (Computer Science and Scientific Computing) by R. Gary Parker ISBN-10: 9780125450751 ISBN-10: 0-12-545075-3 ISBN-13: 9780125450751 ISBN-13: 978-0-12-545075-1 Hardcover 1988-07 Academic Press Find Lowest Price |
Editorials | ||
Book Description 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. | ||
Reviews | ||
A book for graduate-level course with breadth and depth. Several typos. Perhaps the best book on this topic | ||
Excellent book (but expensive) Its one of the best introductory textbooks in the Integer Programming topic (simple and rigorous). Compared with the classic book by Nemhauser and Wolsey, this is a better choice as a first approach to the subject. | ||