Combinatorial Optimization Algorithms and Complexity

Name: Combinatorial Optimization Algorithms and Complexity
Availability: InStock
ISBN: 9780486402581

ISBN-10: 0486402584

ISBN-13: 9780486402581

Edition: Unabridged

Authors: Christos H. Papadimitriou, Kenneth Steiglitz

List price: $30.00

30 day, 100% satisfaction guarantee!

Semester Rental: $19.09 Due date: 8/14/2024

Rental notice: supplementary materials (access codes, CDs, etc.) are not guaranteed with rental orders.

Buy used: $7.21

Marketplace

3 new & used from $4.73

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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..

Book details

List price: $30.00
Publisher: Dover Publications, Incorporated
Publication date: 1/29/1998
Binding: Paperback
Pages: 528
Size: 5.51" wide x 8.50" long x 1.02" tall
Weight: 1.188
Language: English