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...
שמור ב:
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | ספר |
| שפה: | Vietnamese |
| יצא לאור: |
New York
Dover Publications, Inc.
1998
|
| נושאים: | |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| סיכום: | 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. |
|---|---|
| תיאור פיזי: | xvi, 496 p. ill. 22cm |
| ביבליוגרפיה: | Includes bibliographical references and index |
| ISBN: | 9780486402581 |