A First Course in Combinatorial Optimization

by Jon Lee

Overview

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.

Product Details

ISBN-13:	9780521811514
Publisher:	Cambridge University Press
Publication date:	02/09/2004
Series:	Cambridge Texts in Applied Mathematics , #36
Pages:	228
Product dimensions:	5.98(w) x 9.02(h) x 0.67(d)

Table of Contents

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.

Editorial Reviews

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

“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

From the Publisher