Combinatorial Optimization
Autor Christos H. Papadimitriou, Kenneth Steiglitzen Limba Engleză Paperback – feb 2000
Clearly written 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; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. 1982 edition.
.Preț: 138.15 lei
Preț vechi: 183.97 lei
-25%
Puncte Express: 207
Preț estimativ în valută:
24.44€ • 28.82$ • 21.23£
24.44€ • 28.82$ • 21.23£
Carte disponibilă
Livrare economică 02-09 martie
Livrare express 13-19 februarie pentru 84.56 lei
Specificații
ISBN-13: 9780486402581
ISBN-10: 0486402584
Pagini: 528
Dimensiuni: 139 x 215 x 37 mm
Greutate: 0.61 kg
Ediția:Revised
Editura: Dover Publications Inc.
Locul publicării:United States
ISBN-10: 0486402584
Pagini: 528
Dimensiuni: 139 x 215 x 37 mm
Greutate: 0.61 kg
Ediția:Revised
Editura: Dover Publications Inc.
Locul publicării:United States
Descriere
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.