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...
Gorde:
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Liburua |
| Hizkuntza: | Vietnamese |
| Argitaratua: |
New York
Dover Publications, Inc.
1998
|
| Gaiak: | |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| Gaia: | 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. |
|---|---|
| Deskribapen fisikoa: | xvi, 496 p. ill. 22cm |
| Bibliografia: | Includes bibliographical references and index |
| ISBN: | 9780486402581 |