A first course in combinatorial optimization / Jon Lee.
By: Lee, Jon [author.]
.
Material type: 
BookSeries: Cambridge texts in applied mathematics: 36.Publisher: Cambridge : Cambridge University Press, 2004Description: 1 online resource (xvi, 211 pages) : digital, PDF file(s).Content type: text Media type: computer Carrier type: online resourceISBN: 9780511616655 (ebook).Subject(s): Combinatorial optimizationAdditional physical formats: Print version: : No titleDDC classification: 519.6/4 Online resources: Click here to access online Summary: 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.
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
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.
There are no comments for this item.