Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
暫譯: 組合最佳化：理論與演算法（演算法與組合學）

Bernhard Korte, Jens Vygen

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
  • 出版商: Springer
  • 出版日期: 2014-02-22
  • 售價: $3,490
  • 貴賓價: 9.5 折 $3,316
  • 語言: 英文
  • 頁數: 660
  • 裝訂: Paperback
  • ISBN: 3642427677
  • ISBN-13: 9783642427671
  • 相關分類: Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

相關主題

商品描述

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

商品描述(中文翻譯)

這本關於組合優化的綜合教科書特別強調理論結果和具有可證明良好性能的演算法，與啟發式方法形成對比。它基於多門組合優化及專題課程，主要針對研究生層級。本書回顧了基礎知識，詳細涵蓋了經典主題（路徑、流量、配對、母體、NP 完全性、近似演算法），並進一步探討了高級和最新主題，其中一些在教科書中尚未出現。全書包含完整但簡潔的證明，並提供了大量的練習題和參考文獻。

這第五版再次進行了更新、修訂和顯著擴展，新增了超過60個練習題以及關於各種主題的新材料，包括 Cayley 的公式、阻塞流、快速的 b-配對分離、多維背包、多商品最大流最小切割比和最稀切割。因此，本書代表了組合優化的最新技術水平。

類似商品