Quantity:

More Buying Choices

24 used & new from �6.99

Have one to sell? Sell yours here

Share your own customer images

Search inside this book

Combinatorial Optimization: Algorithms and Complexity (Paperback)

by Christos H. Papadimitriou (Author), Kenneth Steiglitz (Author)

5.0 out of 5 stars See all reviews (2 customer reviews)

RRP:	�18.00
Price:	�10.24 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save:	�7.76 (43%)
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.

Only 4 left in stock--order soon (more on the way).

Want guaranteed delivery by Tuesday, November 17? Choose Express delivery at checkout. See Details

15 new from �6.99 9 used from �10.19

Other Editions:	RRP:	Our Price:	Other Offers:
Hardcover			6 used & new from �20.02

Frequently Bought Together

Customers Who Bought This Item Also Bought

Introduction to Topology

by Bert Mendelson

5.0 out of 5 stars (3) �5.30

How to Solve it: A New Aspect of Mathematical Method (Penguin Science)

by George Polya

5.0 out of 5 stars (2) �7.18

Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences)

by Michael R. Garey

5.0 out of 5 stars (1) �39.09

How to Solve It: Modern Heuristics

by Zbigniew Michalewicz

3.5 out of 5 stars (2) �35.97

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (The Morgan Kaufmann Series in Data Management Systems)

by Ian H. Witten

5.0 out of 5 stars (1) �29.67

› Explore similar items

Product details

Paperback: 512 pages
Publisher: Dover Publications Inc.; New edition edition (1 Feb 2000)
Language English
ISBN-10: 0486402584
ISBN-13: 978-0486402581
Product Dimensions: 21.3 x 13.5 x 2.5 cm

Average Customer Review: 5.0 out of 5 stars See all reviews (2 customer reviews)

Amazon.co.uk Sales Rank: 61,085 in Books (See Bestsellers in Books)

Popular in these categories:

#2 in	Books > Scientific, Technical & Medical > Mathematics > Applied Mathematics > Optimisation
#4 in	Books > Scientific, Technical & Medical > Mathematics > Combinatorics & Graph Theory
#7 in	Books > Science & Nature > Mathematics > Optimisation

Would you like to update product info or give feedback on images?

Customers Viewing This Page May Be Interested in These Sponsored Links

(What is this?)

Optimization Engine opens new browser window

CombineNet.com/OptimizationEngine - World's most robust sourcing optimization engine. Read more!

Optimization Toolbox opens new browser window

www.mathworks.com - Solve standard and large-scale optimization problems.

Product Description

Synopsis

A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation c. by Book News, Inc., Por

Inside This Book (Learn More)

Suggested Tags from Similar Products

(What's this?)

Be the first one to add a relevant tag (keyword that's strongly related to this product)

computer science

combinatorics

algorithms

optimization

mathematics

complexity

type m

statistics

graph theory

What Do Customers Ultimately Buy After Viewing This Item?

	76% buy the item featured on this page: Combinatorial Optimization: Algorithms and Complexity 5.0 out of 5 stars (2) �10.24
	9% buy Logicomix: An Epic Search for Truth 5.0 out of 5 stars (6) �10.16
	5% buy Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences) 5.0 out of 5 stars (1) �39.09
	5% buy Computational Complexity: A Modern Approach �25.59

Explore similar items

Customer Reviews

2 Reviews

5 star:		(2)
4 star:		(0)
3 star:		(0)
2 star:		(0)
1 star:		(0)

Average Customer Review

5.0 out of 5 stars (2 customer reviews)

Share your thoughts with other customers:

Create your own review

Most Helpful Customer Reviews

6 of 8 people found the following review helpful:

5.0 out of 5 stars It worths exponentially much more than its price, 11 Mar 2003

By	"gaaw-pal" - See all my reviews

One could buy this book for different reasons: interests in combinatorial optimization, of course; interests in what Papadimitriou has to say, since his thoughts on this subject are definitely invaluable; perhaps the price is a good reason alone.
Whatever the reason, however, I think that would be a rare event to remain duped.

I was preparing my exam in Computability and Complexity when I first used it. I've been wonderfully surprised by the amount of definitions, algorithms, concepts I've found in this book. I think one could use this book for a simple course on Algorithms, on Computability and/or Complexity, on the whole Combinatorial Optimization, and the book would be always and costantly useful.

The chapters on algorithms and complexity, or those on NP completeness have proved to be gems. The chapters on Approximation and Local Search are great, and they feature a bunch of detailed and excellent quality stuff (e.g. there is a detailed treatment of Christofides' algorithm to approximate the TSP, that is quite an idiosyncratic topic).

All in all, a very great book, with a value exponentially greater than the very insignificant price.

Comment Comment (1) | Permalink | Was this review helpful to you? Yes No (Report this)

6 of 8 people found the following review helpful:

5.0 out of 5 stars Excellent., 19 Jun 1998

By A Customer

Every programmer should have read this book. It is complete, detailed and makes a great reference for the engineer's bookshelf. It goes beyong the enumeration of cookie-cutter algorithms , by providing enough theory, to let you create solutions to your own optimization problems.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)

Share your thoughts with other customers: Create your own review

› See all 2 customer reviews...

.jsOffDisplayBlock { display: block; } .jsOffDisplayInline { display: inline; } .jsOffVisibility { visibility: visible; } .jsOnDisplayBlock { display: none; } .jsOnDisplayNoneBlock { display: block; } .jsOnDisplayNoneInline { display: inline; } .jsOnDisplayInline { display: none; } .jsOnVisibility { visibility: hidden; } .jqOnDisplayBlock { display: none; } .jqOnDisplayInline { display: none; } .jqOnVisibility { visibility: hidden; } .jqOnDisplayNoneBlock { display: block; } .jqOnDisplayNoneInline { display: inline; }