Povej prijatelju o tem izdelku:
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou New edition
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
528 pages
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 1. februarja 2000 |
| ISBN13 | 9780486402581 |
| Založniki | Dover Publications Inc. |
| Strani | 528 |
| Dimenzije | 136 × 214 × 26 mm · 644 g |
Več od Christos H. Papadimitriou
Prikaži vseOgled vseh Christos H. Papadimitriou ( Na primer Paperback Book )