The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader ...

New to eBooks.com?

Learn more

A First Course in Combinatorial Optimization

A First Course in Combinatorial Optimization
Add to cart
US$ 36.00
(If any tax is payable it will be calculated and shown at checkout.)
A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
Cambridge University Press; February 2004
229 pages; ISBN 9780511189678
Read online, or download in secure PDF format