A first course in combinatorial optimization
Author(s)
Bibliographic Information
A first course in combinatorial optimization
（Cambridge texts in applied mathematics）
Cambridge University Press, 2004
- : hbk
- : pbk
Available at 25 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: hbkLEE||19||004000378
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
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- 8. Optimizing submodular functions
- Appendix.
by "Nielsen BookData"