A First Course in Combinatorial Optimization [ electronic resource ] / by Jon Lee.
By: Lee, Jon.
Material type:
TextSeries: Cambridge Texts in Applied Mathematics (36). Publisher: Cambridge: Cambridge University Press , 2010ISBN: 9780511616655 ( e-book ).Subject(s): Computer Science | Algorithmics | Complexity | Computer Algebra | Computational Geometry | Mathematical Physics | Differential and Integral Equations | Dynamical Systems and Control Theory | Statistics and ProbabilityGenre/Form: Electronic booksDDC classification: 519.64 Online resources: https://doi.org/10.1017/CBO9780511616655 View to click Summary: A First Course in Combinatorial Optimization is a 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.
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
E-Book
|
WWW | 519.64 SCH/F (Browse shelf) | Available | EB139 |
A First Course in Combinatorial Optimization is a 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.