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.95 lei
-25%
Puncte Express: 207
Preț estimativ în valută:
24.45€ • 28.41$ • 21.19£
24.45€ • 28.41$ • 21.19£
Carte disponibilă
Livrare economică 09-16 februarie
Livrare express 23-29 ianuarie pentru 84.54 lei
Preluare comenzi: 021 569.72.76
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
V-ar putea interesa
-
Mathematical Problems and Proofs: Combinatorics, Number Theory, and GeometryBranislav Kisacanin-15%Preț: 618.50 lei727.65 lei -
Combinatorial OptimizationEugene LawlerPreț: 131.36 lei -
Introduction to Combinatorial AnalysisJohn RiordanPreț: 93.92 lei -
Planar Graphs: Theory and AlgorithmsT. NishizekiPreț: 83.39 lei -
Tilings and PatternsBranko Grunbaum-19%Preț: 278.37 lei345.05 lei -
A First Course in Graph TheoryGary Chartrand-25%Preț: 137.84 lei183.75 lei -
Fractional Graph TheoryEdward R ScheinermanPreț: 90.48 lei -
The Discrete Charm of the Machine – Why the World Became DigitalKenneth SteiglitzPreț: 221.25 lei -
-11%Preț: 494.35 lei555.44 lei -
Graphentheorie für InformatikerWillibald Dörfler-23%Preț: 814.83 lei1058.22 lei
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.