We specialize in hard to find items
(1)
A First Course in Combinatorial Optimization (Cambridge Texts in Applied Mathematics, Series Number 36)
Share Tweet
*Price and Stocks may change without prior notice
*Packaging of actual item may differ from photo shown
- Electrical items MAY be 110 volts.
- 7 Day Return Policy
- All products are genuine and original
About A First Course In Combinatorial Optimization
Product Description Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study. Review "Lee strikes a perfect balance between the specific and the general, between the concrete and the abstract." CHOICE The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly. International Statistical Institute "The book is attractively laid out on the page and there are lots of good diagrams. Algorithms are separated visually in special boxes and are easy to track down. There are plenty of problems (short proofs) and exercises (calculations) and they are well integrated with the text." MAA Reviews, Bill Satzer "Jon Lee's A First Course in Combinatorial Optimization is a brilliant introduction to the topic." - Ryan B. Hayward, University of Alberta Book Description This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Book Description "A First Course in Combinatorial Optimization" is a self-contained text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. The author focuses on the key mathematical ideas that lead to useful models and algorithms rather than on data structures and implementation details. The viewpoint is polyhedral, and the author also uses matroids as a unifying idea.Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study.
