A First Course in Combinatorial Optimization (Hardcover)

Jon Lee

ISBN 10: 0521811511 / ISBN 13: 9780521811514

Published by Cambridge University Press, Cambridge, 2004

About this Item

Hardcover. 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Seller Inventory # 9780521811514

Bibliographic Details

• Title: A First Course in Combinatorial Optimization (Hardcover)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2004
• Language: English
• ISBN 10: 0521811511
• ISBN 13: 9780521811514
• Binding: Hardcover
• Condition: new

About this title

Synopsis

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.

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.