Discrete Optimization

Discrete Optimization

4.75 (4 ratings by Goodreads)
By (author)  , By (author) 

List price: US$157.95

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

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.
show more

Product details

  • Hardback | 472 pages
  • 149.86 x 231.14 x 30.48mm | 680.39g
  • Academic Press Inc
  • San Diego, United States
  • English
  • 0125450753
  • 9780125450751

Review quote

Accessible to students, researchers, and instructors, this work would be valuable both for a university course in discrete optimization and as a reference book. The references are good and up to date.--COMPUTING REVIEWSThe book is cleary and beautifully written. It is a very useful reference on the subject and can be used as an advanced graduate text for courses in combinatorial or discrete optimization.--MATHEMATICAL REVIEWS
show more

Rating details

4 ratings
4.75 out of 5 stars
5 75% (3)
4 25% (1)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X