Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

Papadimitriou, Christos H.
Steiglitz, Kenneth

Paperback

Series: Dover Books on Computer Science

General Mathematics

Currently unavailable to order

ISBN10: 0486402584
ISBN13: 9780486402581
Publisher: Dover Publications
Published: Jan 29 1998
Pages: 528
Weight: 1.17
Height: 1.04 Width: 5.48 Depth: 8.47
Language: English
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. Mathematicians wishing a self-contained introduction need look no further. -- American Mathematical Monthly.

Also in

General Mathematics

View All