Combinatorial Optimization: Algorithms and Complexity (Paperback)
暫譯: 組合優化：演算法與複雜度 (平裝本)
Christos H. Papadimitriou, Kenneth Steiglitz
- 出版商: Dover Publications
- 出版日期: 1998-01-29
- 售價: $1,300
- 貴賓價: 9.5 折 $1,235
- 語言: 英文
- 頁數: 528
- 裝訂: Paperback
- ISBN: 0486402584
- ISBN-13: 9780486402581
-
相關分類:
數學、Algorithms-data-structures、Algorithms-data-structures
立即出貨(限量) (庫存=2)
買這商品的人也買了...
-
PHP 函式庫參考手冊$580$493 -
Algorithms : Sequential , Parallel , and Distributed (Hardcover)$1,100$1,078 -
Linux 驅動程式, 3/e (Linux Device Drivers, 3/e)$980$774 -
資料庫系統原理 (Fundamentals of Database Systems, 5/e)$890$703 -
CCNA: Cisco Certified Network Associate Study Guide (Exam 640-802), 6/e$1,800$1,710 -
WiMAX 技術原理與應用 (Fundamentals of WiMAX)$580$458 -
系統程式 (System Software: An Introduction to Systems Programming, 3/e)(2014年更新版)$680$666 -
組合語言 (Assembly Language for Intel-Based Computers, 5/e)$750$675 -
$399CompTIA Security+Study Guide: Exam SY0-201, 4/e (Paperback) -
全球最強 VMware vSphere 4 企業環境建構$860$731 -
PHP + MySQL 動態網站開發$480$408 -
Computer Networking: A Top-Down Approach, 5/e (IE-Paperback)$1,190$1,166 -
韓式風格網頁整站設計精選 I：電子商務、企業入口網頁、服飾與房產建築$350$273 -
Google Android 2.X 應用程式開發實戰$520$411 -
雲端運算技術指南$490$387 -
JSP 2.0 動態網頁入門實務：Web 應用程式/資料庫應用/JNDI/JavaMail/XML/AJAX/自訂標籤/JSTL/EL/MVC$660$521 -
Pro/ENGINEER Wildfire 5.0 零件設計入門與實例$550$435 -
Hello, Android─Android 手機開發平台速習講座 (Hello, Android, 2/e)$400$316 -
遊戲設計概論, 2/e$580$452 -
3ds Max 2011 自學的王道$680$578 -
嵌入式系統開發之道－菜鳥成長日誌與專案經理的私房菜$850$672 -
C# 程式開發範例集$680$578 -
Theory of Computational Complexity, 2/e (Hardcover)$1,640$1,607 -
區塊鏈：金融科技與創新 (Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction)$450$428 -
Matrix Algebra Useful for Statistics, 2/e (Hardcover)$1,460$1,431
相關主題
商品描述
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 ed.
商品描述(中文翻譯)
這本清晰易懂、數學上嚴謹的文本包含了對單純形法（simplex method）的新穎算法闡述，並討論了蘇聯的橢圓體算法（ellipsoid algorithm）在線性規劃中的應用；高效的網路流（network flow）、匹配（matching）、生成樹（spanning trees）和矩陣（matroids）算法；NP 完全問題（NP-complete problems）的理論；近似算法（approximation algorithms）、針對 NP 完全問題的局部搜尋啟發式（local search heuristics）等。所有章節均附有引人深思的問題。這是一本對於具有計算機科學、運籌學和電機工程背景的研究生非常有用的著作。「希望獲得自成體系介紹的數學家不必再尋找其他資料。」—《美國數學月刊》（American Mathematical Monthly）。1982 年版。
