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ơ |
|---|
| LEADER | 01219nam a22002177a 4500 | ||
|---|---|---|---|
| 001 | NCT_95535 | ||
| 008 | 220112b xxu||||| |||| 00| 0 vie d | ||
| 999 | |c 4745 |d 4745 | ||
| 020 | |a 9780486402581 |c 1282000 | ||
| 082 | 0 | 4 | |2 23rd ed. |a 519.3 |b P213 |
| 100 | 1 | |a Papadimitriou, Christos H. | |
| 245 | 1 | 0 | |a Combinatorial Optimization : |b Algorithms and complexity |c Christos H. Papadimitriou, Kenneth Steiglitz |
| 260 | |a New York |b Dover Publications, Inc. |c 1998 | ||
| 300 | |a xvi, 496 p. |b ill. |c 22cm | ||
| 504 | |a Includes bibliographical references and index | ||
| 520 | 3 | |a 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. | |
| 653 | |a Công nghệ thông tin | ||
| 700 | 1 | |a Steiglitz, Kenneth | |
| 942 | |2 ddc |c BK | ||
| 952 | |0 0 |1 0 |2 ddc |4 0 |6 519_300000000000000_P213 |7 0 |9 22123 |a 000001 |b 000001 |d 2022-01-12 |o 519.3 P213 |p MD.19189 |r 2022-01-12 |v 999999.99 |w 2022-01-12 |y BK | ||
| 980 | |a Thư viện Trường Đại học Nam Cần Thơ | ||