Combinatorial Optimization : Algorithms and complexity
This book includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search...
Kaydedildi:
| Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Kitap |
| Dil: | Vietnamese |
| Baskı/Yayın Bilgisi: |
New York
Dover Publications, Inc.
1998
|
| Konular: | |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| Özet: | This book includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. |
|---|---|
| Fiziksel Özellikler: | xvi, 496 p. ill. 22cm |
| Bibliyografya: | Includes bibliographical references and index |
| ISBN: | 9780486402581 |