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
|
| Предметы: | |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| 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 |