Buch, Englisch, Band 36, 228 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 377 g
Buch, Englisch, Band 36, 228 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 377 g
Reihe: Cambridge Texts in Applied Mathematics
ISBN: 978-0-521-01012-2
Verlag: Cambridge University Press
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.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
- Mathematik | Informatik EDV | Informatik Informatik
- Mathematik | Informatik Mathematik Operations Research Spieltheorie
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
- Mathematik | Informatik Mathematik Stochastik Mathematische Statistik
Weitere Infos & Material
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.
