跳至内容
Combinatorial optimization : algorithms and complexity 線上預覽
關閉線上預覽
正在查...

Combinatorial optimization : algorithms and complexity

作者: Christos H Papadimitriou; Kenneth Steiglitz
出版商: Englewood Cliffs, N.J. : Prentice Hall, ©1982.
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
提要:
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

其他的實體格式: Online version:
Papadimitriou, Christos H.
Combinatorial optimization.
Englewood Cliffs, N.J. : Prentice Hall, ©1982
(OCoLC)558516482
文件類型: 圖書
所有的作者/貢獻者: Christos H Papadimitriou; Kenneth Steiglitz
ISBN: 0131524623 9780131524620 0486402584 9780486402581
OCLC系統控制編碼: 7463296
描述: xvi, 496 pages : illustrations ; 24 cm
内容: Optimization problems --
The simplex algorithm --
Duality --
computational considerations for the simplex algorithm --
The primal-dual algorithm --
Primal-dual algorithms for max-flow and shortest path: Ford-Fulkerson and Dijkstra --
Primal-dual algorithms for min-cost flow --
Algorithms and complexity --
Efficient algorithms for the max-flow problem --
Algorithms for matching --
Weighted matching --
Spanning trees and matroids --
Integer linear programming --
A cutting-lane algorithm for integer linear programs --
NP-complete problems --
More about NP-completeness --
Approximation algorithms --
Branch-and-bound and dynamic programming --
Local search.
責任: Christos H. Papadimitriou, Kenneth Steiglitz.

摘要:

Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/7463296>
library:oclcnum"7463296"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/7463296>
rdf:typeschema:Book
schema:about
<http://experiment.worldcat.org/entity/work/data/478349163#Topic/optimisation_mathematique>
rdf:typeschema:Intangible
schema:name"Optimisation mathématique."@en
schema:name"Optimisation mathématique."@fr
schema:name"optimisation mathématique."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:copyrightYear"1982"
schema:creator
schema:datePublished"1982"
schema:description"Optimization problems -- The simplex algorithm -- Duality -- computational considerations for the simplex algorithm -- The primal-dual algorithm -- Primal-dual algorithms for max-flow and shortest path: Ford-Fulkerson and Dijkstra -- Primal-dual algorithms for min-cost flow -- Algorithms and complexity -- Efficient algorithms for the max-flow problem -- Algorithms for matching -- Weighted matching -- Spanning trees and matroids -- Integer linear programming -- A cutting-lane algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search."@en
schema:description"Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/478349163>
schema:inLanguage"en"
schema:name"Combinatorial optimization : algorithms and complexity"@en
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.