Combinatorial Optimization

Algorithms and Complexity

By: CHRISTOS H. PAPADIMITRIOU

Write A Review

Paperback | 1 February 2000

At a Glance

Paperback
528 Pages

Edition Type
New edition

Dimensions(cm)
20.9 x 13.6 x 2.6

Paperback

RRP $85.00

$53.99

36%OFF

or 4 interest-free payments of $13.50 with

Ships in 10 to 15 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.