Combinatorial Optimization: Algorithms and Complexity
Combinatorial Optimization: Algorithms and Complexity
Papadimitriou, Christos H.
product information
Condition: New, UPC: 9780486402581, Publication Date: Thu, January 1, 1998, Type: Paperback ,
join & start selling
description
9This 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.
reviews

Be the first to write a review

member goods

No member items were found under this heading.

notems store

Return Policy

All sales are final

Shipping

No special shipping considerations available.
Shipping fees determined at checkout.
promoting relevance through notable postings ]
share it, buy it, sell it ]

A notem is a post that highlights an experience, idea, topic of interest, an event ... whatever a member believes worthy of discussion. Each notem becomes a pathway by which to make meaningful connections.

notems is a free, global social network that rewards members by the number and quality of notems they post.

notemote® © . Privacy Policy. Developed by Hartmann Software Group