A First Course in Combinatorial Optimization
1st Edition
Published on 15. May 2006
978-0-511-18967-8 (ISBN)
Description
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.
Reviews / Votes
'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 InstituteMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises
File size
1,62 MB
ISBN-13
978-0-511-18967-8 (9780511189678)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
02/2004
Cambridge University Press
€64.80
Shipment within 15-20 days
Book
02/2004
Cambridge University Press
€107.20
Shipment within 15-20 days
Person
Content
Introduction; Polytopes and linear programming; 1. Matroids and the greedy algorithm; 2. Minimum-weight dipaths; 3. Matroid intersection; 4. Matching; 5. Flows and cuts; 6. Cutting planes; 7. Branch-&-bound; 8. Optimizing submodular functions; Appendix.
