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...
Đã lưu trong:
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Bog |
| Sprog: | Vietnamese |
| Udgivet: |
New York
Dover Publications, Inc.
1998
|
| Fag: | |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| Summary: | 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 beskrivelse: | xvi, 496 p. ill. 22cm |
| Bibliografi: | Includes bibliographical references and index |
| ISBN: | 9780486402581 |