A First Course in Combinatorial Optimization (Cambridge Texts in Applied Mathematics 36)

A First Course in Combinatorial Optimization (Cambridge Texts in Applied Mathematics 36)

By: Jon Lee (author)Paperback

Special OrderSpecial Order item not currently available. We'll try and order for you.


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.


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- 8. Optimizing submodular functions; Appendix.

Product Details

  • ISBN13: 9780521010122
  • Format: Paperback
  • Number Of Pages: 228
  • ID: 9780521010122
  • weight: 312
  • ISBN10: 0521010128

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly