Skip to content
Register Sign in Wishlist
A First Course in Combinatorial Optimization

A First Course in Combinatorial Optimization

$51.99 (P)

Part of Cambridge Texts in Applied Mathematics

  • Author: Jon Lee, University of Michigan, Ann Arbor
  • Date Published: February 2004
  • availability: Available
  • format: Paperback
  • isbn: 9780521010122

$ 51.99 (P)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Request examination copy

Instructors may request a copy of this title for examination

Product filter button
About the Authors
  • 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.

    • Self contained (includes all linear-programming preliminaries)
    • Aimed as a one-semester textbook (not a research monograph)
    • Problems and exercises interspersed in the exposition, making the text a 'workbook' for the student
    Read more

    Reviews & endorsements

    "Lee strikes a perfect balance between the specific and the general, between the concrete and the abstract."

    “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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: February 2004
    • format: Paperback
    • isbn: 9780521010122
    • length: 228 pages
    • dimensions: 229 x 152 x 17 mm
    • weight: 0.312kg
    • availability: Available
  • Table of Contents

    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

  • Instructors have used or reviewed this title for the following courses

    • Integer Programming and Combinatorial Optimization
  • Author

    Jon Lee, University of Michigan, Ann Arbor

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.