Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
More Buying Choices
Have one to sell? Sell yours here
Combinatorial Optimization: Algorithms and Complexity
 
See larger image
 

Combinatorial Optimization: Algorithms and Complexity [Paperback]

Christos H. Papadimitriou , Kenneth Steiglitz
4.9 out of 5 stars  See all reviews (7 customer reviews)
List Price: CDN$ 29.75
Price: CDN$ 16.97 & eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details
You Save: CDN$ 12.78 (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.
Ships from and sold by Amazon.ca. Gift-wrap available.
Only 4 left in stock--order soon (more on the way).
Want it delivered Tuesday, May 29? Choose One-Day Shipping at checkout.

Formats

Amazon Price New from Used from
Hardcover --  
Paperback CDN $16.97  

Frequently Bought Together

Customers buy this book with Combinatorial Optimization: Networks and Matroids CDN$ 16.62

Combinatorial Optimization: Algorithms and Complexity + Combinatorial Optimization: Networks and Matroids
Price For Both: CDN$ 33.59

Show availability and shipping details

  • This item: Combinatorial Optimization: Algorithms and Complexity

    In Stock.
    Ships from and sold by Amazon.ca.
    Eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details

  • Combinatorial Optimization: Networks and Matroids

    In Stock.
    Ships from and sold by Amazon.ca.
    Eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details


Customers Who Viewed This Item Also Viewed


Product Details


Product Description

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

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

 

Customer Reviews

7 Reviews
5 star:
 (6)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.9 out of 5 stars (7 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most helpful customer reviews

3 of 3 people found the following review helpful
4.0 out of 5 stars A classic, May 7 1999
By 
SeanFurl (San Francisco) - See all my reviews
This review is from: Combinatorial Optimization: Algorithms and Complexity (Paperback)
This is just a note to mention that athough Amazon has dated this book as published in 1998, it is actually around 15 years old. By the way, it's a good book, but I didn't find it an easy read, especially the first half. One needs to already have a foundation in linear programming and optimization to digest it. A previous reviewer who said that every programmer should read it was being unduly exuberant, presumably because it happened to hit his particular spot. Most programmers don't need combinatorial optimization and for those who do there are some good alternative books.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


3 of 3 people found the following review helpful
5.0 out of 5 stars Inexpensive, excellently written, and quite interesting!, Nov 14 2002
By 
Todd Ebert (Long Beach California) - See all my reviews
This review is from: Combinatorial Optimization: Algorithms and Complexity (Paperback)
I had this book on my shelf for two years before taking a serious look at it, and only wish I had read it much earlier in life. Christos Papadimitriou has written quite a gem! On one hand this book serves as a good introduction to combinatorial optimization algorithms, in that it provides a flawless introduction to the simplex algorithm, linear and integer programming, and search techniques such as Branch-and-Bound and dynamic programming. On another, it serves as a good reference for many graph-theoretic algorithms. But most importantly Papadimitriou and Steiglitz seem to be on a quest to understand why some problems, such as Minimum Path or Matching, have efficient solutions, while others, such as Traveling Salesman, do not. And in doing so they end up providing the reader with a big picture behind algorithms and complexity, and the connection between optimization problems and complexity.

After reading this and Papadimitriou's "Introduction to Computational Complexity" (which I also highly recommend), I now consider him one of the best at conveying complex ideas in a way that rarely confuses the reader. I also had the priviledge of attending one of his talks on complexity, and he seems just as effusive and transparent as a lecturer as he does a writer. Ah, for once I bought a Dover book that did not disappoint.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


1 of 1 people found the following review helpful
5.0 out of 5 stars It worths exponentially much more than its price, Jun 21 2002
By 
G. Avvinti (Sicily, Italy) - See all my reviews
(REAL NAME)   
This review is from: Combinatorial Optimization: Algorithms and Complexity (Paperback)
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.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
 Go to Amazon.com to see all 19 reviews  4.6 out of 5 stars 
 
 
Most recent customer reviews





Only search this product's reviews



Listmania!

Create a Listmania! list

Look for similar items by category


Look for similar items by subject


Feedback


Amazon.ca Privacy Statement Amazon.ca Shipping Information Amazon.ca Returns & Exchanges