Jon LeeCambridge University Press, 4/1/2004EAN 9780521811514, ISBN10: 0521811511Hardcover, 228 pages, 22.9 x 15.2 x 1.7 cmLanguage: EnglishA 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.IntroductionPolytopes and linear programming1. Matroids and the greedy algorithm2. Minimum-weight dipaths3. Matroid intersection4. Matching5. Flows and cuts6. Cutting planes7. Branch-&-bound8. Optimizing submodular functionsAppendix.
