Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Unabridged Edition
Use the Amazon App to scan ISBNs and compare prices.
Wiley Summer Savings Event.
Save up to 40% during Wiley's Summer Savings Event. Learn more.
Frequently Bought Together
Customers Who Bought This Item Also Bought
Top Customer Reviews
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.
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.
As another reader has remarked, this book is quite old though (published first in 1982). For a more to date book on Combinatorial Optimisation, one might want to look at Cook, Cunningham, Pulleyblank and Schrijver's book on Combinatorial Optimisation (published in 1998).
Chap. 1 Optimization Problems 1.1 Introduction; 1.2 Optimization Problems; 1.3 Neighborhoods; 1.4 Local and Global Optima; 1.5 Convex Sets and Functions; 1.6 Convex Programming Problems
Chap. 2 The Simplex Algorithm 2.1 Forms of the Linear Programming Problem; 2.2 Basic Feasible Solutions; 2.3 The Geometry of Linear Programs; 2.3.1 Linear and Affine Spaces; 2.3.2 Convex Polytopes; 2.3.3 Polytopes and LP; 2.4 Moving from bfs to bfs; 2.5 Organization of a Tableau; 2.6 Choosing a Profitable Column; 2.7 Degeneracy and Bland's Anticycling Algorithm; 2.8 Beginning the Simplex Algorithm; 2.9 Geometric Aspects of Pivoting
Chap. 3 Duality 3.1 The Dual of a Linear Program in General Form; 3.2 Complementary Slackness; 3.3 Farkas' Lemma; 3.4 The Shortest-Path Problem and Its Dual; 3.5 Dual Information in the Tableau; 3.6 The Dual Simplex Algorithm; 3.7 Interpretation of the Dual Simplex Algorithm
Chap. 4 Computational Considerations for the Simplex Algorithm 4.1 The Revised Simplex Algorithm; 4.2 Compuational Implications of the Revised Simplex Algorithm; 4.3 The Max-Flow Problem and Its Solution by the Revised Method; 4.4 Dantzig-Wolfe Decomposition
Chap. 5 The Primal-Dual Algorithm 5.1 Introduction; 5.2 The Primal-Dual Algorithm; 5.3 Comments on the Primal-Dual Algorithm; 5.4 The Primal-Dual Method Applied to the Shortest-Path Problem; 5.5 Comments on Methodology; 5.6 The Primal-Dual Method Applied to Max-Flow
Chap. 6 Primal-Dual Algorithms for Max-Flow and Shortest Path: Ford-Fulkerson and Dijkstra 6.1 The Max-Flow, Min-Cut Theorem; 6.2 The Ford and Fulkerson Labeling Algorithm; 6.Read more ›
Most Recent Customer Reviews
The book is good. The only issue I have is the Kindle e-book for it. The text is great since there are real text, hence scalable and can reflow when I rotate my tablet. Read morePublished 1 month ago by Manchor Ko
It is a classical and introduction-level book about combinatorial optimization. Although the book is published in 1998, the contents are still useful for current readers who would... Read morePublished 12 months ago by Jun Qi
This book was a present for my son , who is a student (undergraduate studies ) in the School of electrical and computer engineering in NTUA, that is the same technical university... Read morePublished 20 months ago by Fotios M.
This book is rife with clear examples, often considered several times from differing viewpoints. The writing is clear, and the figures are informative and plentiful -- and the... Read morePublished on May 13, 2012 by Andrew Zukoski
Effortless five stars. This is now almost 30 years old, and it is still a standard reference for the sorts of problems it addresses, in spite of the fact that those problems are... Read morePublished on November 13, 2010 by S. Matthews
I read the book and found it very helpful. It has a very excellent point of view and very easy to understand.Published on May 4, 2008 by Bo Li