Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Optimization de Christos H. Papadimitriou

Combinatorial Optimization: Dover Books on Computer Science

Autor Christos H. Papadimitriou, Kenneth Steiglitz
en Limba Engleză Paperback – 31 ian 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.
.
Citește tot Restrânge

Din seria Dover Books on Computer Science

  • A Short Course in Discrete Mathematics
    Preț: 8742 lei
  • Mathematical Economics
    Preț: 12991 lei
  • Linear Programming and Economic Analysis
    Preț: 16680 lei
  • Methods of Operations Research
    Preț: 11319 lei
  • Linear Programming: Methods and Applications
    Preț: 17607 lei
  • Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations
    Preț: 9813 lei
  • Nonlinear Programming: Analysis and Methods
    Preț: 16680 lei
  • Dynamic Programming
    Preț: 12660 lei
  • Boolean Algebra and Its Applications
    Preț: 6865 lei
  • 39% Data Structures & Algorithm Analysis in C++
    Preț: 14328 lei
  • Dynamic Programming: Models and Applications
    Preț: 9173 lei

Preț: 13291 lei

Preț vechi: 16919 lei
-21% Nou

Puncte Express: 199
Preț estimativ în valută:
2544€ • 2645$ • 2129£

Carte disponibilă

Livrare economică 21-28 februarie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780486402581
ISBN-10: 0486402584
Pagini: 496
Dimensiuni: 139 x 215 x 26 mm
Greutate: 0.53 kg
Ediția:Revised
Editura: Dover Publications
Seria Dover Books on Computer Science

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.