コンテンツへ移動
Combinatorial optimization : algorithms and complexity 資料のプレビュー
閉じる資料のプレビュー
確認中…

Combinatorial optimization : algorithms and complexity

著者: Christos H Papadimitriou; Kenneth Steiglitz
出版: Englewood Cliffs, N.J. : Prentice Hall, ©1982.
エディション/フォーマット:   書籍 : Englishすべてのエディションとフォーマットを見る
データベース: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, c1982
(OCoLC)558516482
ドキュメントの種類: 図書
すべての著者/寄与者: Christos H Papadimitriou; Kenneth Steiglitz
ISBN: 0131524623 9780131524620 0486402584 9780486402581
OCLC No.: 7463296
物理形態: xvi, 496 p. : ill. ; 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のレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<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
<http://id.worldcat.org/fast/868980>
rdf:typeschema:Intangible
schema:name"Combinatorial optimization"@en
schema:name"Combinatorial optimization."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1012099>
rdf:typeschema:Intangible
schema:name"Mathematical optimization"@en
schema:name"Mathematical optimization."@en
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
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:numberOfPages"496"
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.