跳至内容
Combinatorial optimization : papers from the DIMACS Special Year 線上預覽
關閉線上預覽
正在查...

Combinatorial optimization : papers from the DIMACS Special Year

作者: William Cook; László Lovász; Paul D Seymour; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
出版商: [Providence, R.I.] : American Mathematical Society, ©1995.
叢書: DIMACS series in discrete mathematics and theoretical computer science, v. 20.
版本/格式:   圖書 : 會議刊物 : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

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

主題
更多類似這樣的

 

在線上查詢

與資料的連結

在圖書館查詢

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

詳細書目

類型/形式: Conference proceedings
Congresses
資料類型: 會議刊物, 網際網路資源
文件類型: 圖書, 網路資源
所有的作者/貢獻者: William Cook; László Lovász; Paul D Seymour; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
ISBN: 0821802399 9780821802397
OCLC系統控制編碼: 31900331
注意: Papers from workshops held at DIMACS at Rutgers University Sept. 1992-Aug. 1993.
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."
描述: xi, 441 pages : illustrations ; 27 cm.
内容: Hypermetrics in geometry of numbers / M. Deza, V.P. Grishukhin, and M. Laurent --
Practical problem solving with cutting plane algorithms in combinatorial optimization / Michael Jünger, Gerhard Reinelt, and Stefan Thienel --
Randomized algorithms in combinatioral optimization / László Lovász --
Maximum cuts and largest bipartite subgraphs / Svatopluk Poljak and Zsolt Tuza --
Algorithms and reformulations for lot sizing problems / Yves Pochet and Laurence A. Wolsey --
Efficient algorithms for disjoint in planar graphs / Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe --
Computing near-optimal solutions to combinatorial optimization problems / David B. Shmoys --
Graph entropy : a survey / Gábor Simonyi.
叢書名: DIMACS series in discrete mathematics and theoretical computer science, v. 20.
責任: William Cook, László Lovász, Paul Seymour, editors.
更多資訊:

評論

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

標籤

成爲第一個
確認申請

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

連結資料


<http://www.worldcat.org/oclc/31900331>
library:oclcnum"31900331"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
rdf:valueUnknown value: cnp
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:contributor
<http://viaf.org/viaf/160155122>
rdf:typeschema:Organization
schema:name"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science."
schema:copyrightYear"1995"
schema:datePublished"1995"
schema:description"Hypermetrics in geometry of numbers / M. Deza, V.P. Grishukhin, and M. Laurent -- Practical problem solving with cutting plane algorithms in combinatorial optimization / Michael Jünger, Gerhard Reinelt, and Stefan Thienel -- Randomized algorithms in combinatioral optimization / László Lovász -- Maximum cuts and largest bipartite subgraphs / Svatopluk Poljak and Zsolt Tuza -- Algorithms and reformulations for lot sizing problems / Yves Pochet and Laurence A. Wolsey -- Efficient algorithms for disjoint in planar graphs / Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe -- Computing near-optimal solutions to combinatorial optimization problems / David B. Shmoys -- Graph entropy : a survey / Gábor Simonyi."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/865050804>
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:isPartOf
<http://worldcat.org/issn/1052-1798>
rdf:typeschema:Series
schema:hasPart<http://www.worldcat.org/oclc/31900331>
schema:issn"1052-1798"
schema:name"DIMACS series in discrete mathematics and theoretical computer science,"
schema:name"Combinatorial optimization : papers from the DIMACS Special Year"@en
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

關閉視窗

請登入WorldCat 

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