A First Course in Combinatorial Optimization

Jon Lee

A First Course in Combinatorial Optimization
  • 出版商: Cambridge
  • 出版日期: 2004-02-09
  • 售價: $820
  • 貴賓價: 9.8 折 $804
  • 語言: 英文
  • 頁數: 228
  • 裝訂: Paperback
  • ISBN: 0521010128
  • ISBN-13: 9780521010122

    • 下單後立即進貨 (約5~7天)

買這商品的人也買了...

相關主題

商品描述

Description:

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.

商品描述(中文翻譯)

描述：

Jon Lee 在這本針對運籌學、數學和計算機科學學生的入門研究生級教材中，專注於關鍵的數學概念，以便導出有用的模型和演算法，而非數據結構和實現細節。其觀點為多面體，Lee 也使用了 matroids 作為統一的概念。主題包括線性和整數規劃、多面體、matroids 及 matroid 優化、最短路徑和網絡流。書中包含了問題和練習，並提供了進一步研究的參考資料。

目錄：

引言；0. 多面體和線性規劃；1. Matroids 和貪婪演算法；2. 最小權重有向路徑；3. Matroid 交集；4. 匹配；5. 流和切割；6. 切割平面；7. 分支與界限；8. 優化子模函數；附錄。

類似商品