Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
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.Read more
- 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
Reviews & endorsements
"Lee strikes a perfect balance between the specific and the general, between the concrete and the abstract."
CHOICESee more reviews
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
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: February 2004
- format: Paperback
- isbn: 9780521010122
- length: 228 pages
- dimensions: 229 x 152 x 13 mm
- weight: 0.34kg
- availability: Available
Table of Contents
Polytopes and linear programming
1. Matroids and the greedy algorithm
2. Minimum-weight dipaths
3. Matroid intersection
5. Flows and cuts
6. Cutting planes
8. Optimizing submodular functions
Instructors have used or reviewed this title for the following courses
- Integer Programming and Combinatorial Optimization
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×