Combinatorial Optimization

Algorithms and Complexity

By:

Christos H Papadimitriou

Format:

Paperback / softback

Series:

Dover Books on Computer Science

Show Hide Adult Content

$67.99

RRP:: ~~$85.00~~ save 20%

Available from supplier

Usually ships in 2-3 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

Afterpay is available on orders $100 to $2000 Learn more

Availability

Delivering to:

Estimated arrival:

Around 7-19 June using International Courier

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.

Release date Australia

February 1st, 2000

Author

Christos H Papadimitriou

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational
Undergraduate

Pages

528

Series

Dover Books on Computer Science

Dimensions

141x216x27

ISBN-13

9780486402581

Product ID

1824844

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Non-Fiction Books:

Combinatorial Optimization

By:

Format:

Series:

Buy Now, Pay Later with:

Availability

Description

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Get free delivery, exclusive deals, and more^*