Mendeley出力
＜図書＞
Disjoint paths, hypergraphs
| 責任表示 | Alexander Schrijver |
|---|---|
| シリーズ | Algorithms and combinatorics ; 24. Combinatorial optimization : polyhedra and efficiency / Alexander Schrijver ; v. C |
| データ種別 | 図書 |
| 出版情報 | Berlin ; Tokyo : Springer , c2003 |
| 本文言語 | 英語 |
| 大きさ | xxxiii, p. 1222-1881 : ill. ; 25 cm |
| 概要 | An in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong ...inks to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented. 続きを見る |
| 目次 | v. A. Paths, flows, matchings v. B. Matroids, trees, stable sets v. C. Disjoint paths, hypergraphs. |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図3F 数理独自 | SCHR/40/2-3 | 2003 |
|
023212002008391 |
|
書誌詳細
| 一般注記 | "Chapters 70-83" Includes bibliographical references and indexes |
|---|---|
| 著者標目 | *Schrijver, Alexander |
| 件 名 | LCSH:Combinatorial optimization |
| 分 類 | LCC:QA402.2.S3535 DC21:519.3 |
| 書誌ID | 1001397516 |
| ISBN | 3540443894 |
| NCID | BA60772796 |
| 巻冊次 | ISBN:3540443894 |
| 登録日 | 2009.11.02 |
| 更新日 | 2009.11.02 |