跳到内容
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 

没有张号吗?很容易就可以 建立免费的账号.