Goodreads helps you keep track of books you want to read.
Start by marking “Combinatorial Optimization: Algorithms and Complexity” as Want to Read:
Combinatorial Optimization: Algorithms and Complexity
Enlarge cover
Rate this book
Clear rating
Open Preview

Combinatorial Optimization: Algorithms and Complexity

3.9  ·  Rating Details ·  70 Ratings  ·  4 Reviews
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 problem ...more
Paperback, 528 pages
Published January 29th 1998 by Dover Publications
More Details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Combinatorial Optimization, please sign up.

Be the first to ask a question about Combinatorial Optimization

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-30 of 304)
filter  |  sort: default (?)  |  Rating Details
Bernhard Geiger
Mar 31, 2015 Bernhard Geiger rated it it was ok
First: I'm no expert in optimization, and this might be one reason why I did not like this book that much. I also skipped a good portion of the book, which I considered not being relevant for my work. One of the main drawbacks of this book is that, although the title speaks of combinatorial optimization, the topic is (integer) linear programming. I would have preferred at least a few chapters on nonlinear integer problems.

Chapter 2 concerned the simplex algorithm and was a pleasure to read. Chap
...more
Nick Black
Dec 05, 2007 Nick Black rated it it was amazing
An immediate classic and still the basic textbook in its field, you simply will not find a better deal than this $19.95 gift to the combinatorially-minded public from the wonderful folk at Dover Mathematical Publishing ([sniff] god bless and keep those men!).
dead letter office
Apr 17, 2008 dead letter office rated it really liked it
Shelves: texts
a $19 classic text on combinatorial optimization. thank you dover.
DJ
Jan 22, 2010 DJ marked it as to-read
Shelves: computer-science
another gem from Dover
Dio Mavroyannis
Dio Mavroyannis marked it as to-read
Sep 22, 2016
Tao Kai
Tao Kai marked it as to-read
Sep 19, 2016
Wen Shen
Wen Shen rated it it was amazing
Sep 19, 2016
BookDB
BookDB marked it as to-read
Sep 14, 2016
Claudio Tanci
Claudio Tanci marked it as to-read
Sep 10, 2016
Zhaodan Kong
Zhaodan Kong is currently reading it
Sep 02, 2016
Dn
Dn marked it as to-read
Aug 31, 2016
Amani
Amani marked it as to-read
Aug 20, 2016
Lee
Lee marked it as to-read
Aug 15, 2016
Stephen Lee
Stephen Lee marked it as to-read
Aug 12, 2016
Juk
Juk marked it as to-read
Jul 23, 2016
Al VYn
Al VYn marked it as to-read
Jul 21, 2016
Pat Swanson
Pat Swanson marked it as to-read
Jul 19, 2016
ne
ne marked it as to-read
Jul 17, 2016
Sutton
Sutton marked it as to-read
Jul 16, 2016
Manuel Bellido
Manuel Bellido rated it really liked it
Jul 07, 2016
Burcu B. Keskin
Burcu B. Keskin rated it it was amazing
Jul 06, 2016
Omar
Omar marked it as to-read
Jun 19, 2016
Arash Ashrafzadeh
Arash Ashrafzadeh marked it as to-read
Jun 18, 2016
vidya
vidya is currently reading it
Jun 17, 2016
Louis Maddox
Louis Maddox marked it as to-read
Jun 16, 2016
Modiga Melo
Modiga Melo marked it as to-read
Jun 16, 2016
Marie Sha
Marie Sha rated it it was amazing
Jun 09, 2016
Tony
Tony rated it it was amazing
Jun 03, 2016
Liam
Liam marked it as to-read
Jun 02, 2016
Safarione95
Safarione95 marked it as to-read
May 27, 2016
« previous 1 3 4 5 6 7 8 9 10 11 next »
There are no discussion topics on this book yet. Be the first to start one »
  • Computers and Intractability: A Guide to the Theory of NP-Completeness
  • Introduction to the Theory of Computation
  • Basic Category Theory for Computer Scientists
  • The Haskell Road to Logic, Maths and Programming. Second Edition
  • Introduction to Automata Theory, Languages, and Computation
  • Computational Complexity: A Modern Approach
  • Numerical Methods for Scientists and Engineers
  • Feynman Lectures On Computation
  • Concrete Mathematics: A Foundation for Computer Science
  • Mathematics: Its Content, Methods and Meaning
  • Conceptual Mathematics: A First Introduction To Categories
  • Number Theory
  • Ordinary Differential Equations
  • Computer Architecture: A Quantitative Approach
  • An Introduction to Information Theory: Symbols, Signals and Noise
  • Real and Complex Analysis
  • Pearls of Functional Algorithm Design
  • Linear Algebra and Its Applications

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »
Christos Harilaos Papadimitriou (Greek: Χρίστος Χ. Παπαδημητρίου) is a Professor in the Computer Science Division at the University of California, Berkeley, United States.
Papadimitriou is the author of the textbook Computational Complexity and has co-authored Algorithms with Sanjoy Dasgupta and Umesh Vazirani.
He has collaborated with Apostolos Doxiadis on the graphic novel Logicomix, and has pub
...more
More about Christos H. Papadimitriou...

Share This Book