Hopp til hovedinnholdet

Combinatorial Optimization

  • Pocket

  • 2000

  • Engelsk

Algorithms and Complexity

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.

    Ikke tilgjengelig for Klikk&Hent

    På nettlager. Bestilles fra England. Leveres normalt innen 5-8 virkedager.

    • Bytt i alle våre butikker
    • Klikk og hent