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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Övriga upphovsmän: | |
| Materialtyp: | Bok |
| Språk: | Vietnamese |
| Publicerad: |
New York
Dover Publications, Inc.
1998
|
| Ämnen: | |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| Sammanfattning: | 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. |
|---|---|
| Fysisk beskrivning: | xvi, 496 p. ill. 22cm |
| Bibliografi: | Includes bibliographical references and index |
| ISBN: | 9780486402581 |