A First Course in Combinatorial Optimization

Jon Lee

  • 出版商: Cambridge
  • 出版日期: 2004-01-04
  • 售價: $820
  • 貴賓價: 9.8$804
  • 語言: 英文
  • 頁數: 228
  • 裝訂: Paperback
  • ISBN: 0521010128
  • ISBN-13: 9780521010122
  • 下單後立即進貨 (約5~7天)




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.


Table of Contents:

Introduction; 0. 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.