DeepRead
Cover of Combinatorial optimization

Combinatorial optimization

Christos H. Papadimitriou · 1981

Mathematics and physics › Numerical and matrix computation

#9,875 most recommended

About the book

A graduate-level text by Christos H. Papadimitriou and Kenneth Steiglitz on combinatorial optimization, the problem of choosing the best element from a finite but very large set of feasible solutions. It covers linear programming and polyhedral methods, network flow, matching, the traveling salesman and other standard problems, and the algorithmic techniques used to attack them. It was written for students in computer science, operations research, and electrical engineering. The book holds that algorithm design for optimization problems and the theory of computational complexity belong together, since mathematical programming tells you how to find good solutions while complexity theory tells you which problems admit efficient exact methods at all. It presents NP-completeness as a practical boundary that shapes how problems should be approached, and it treats approximation algorithms, local search, and enumeration with pruning as responses to intractability. Its main claim is that a unified treatment of these two traditions gives a clearer picture of what can and cannot be computed efficiently.

Written by Claude from what it knows of this book.

What Hacker News says 33% recommend · 0% critical

00.5120102015202020242010 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 9 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1981
ISBN
9780486402581
Editions known
8 at Open Library
Open Library
OL1891358W

Combinatorial analysisCombinatorial optimizationComputational complexityMathematical optimizationQa402.5 .p37

Explore in the mosaic

Read next: its neighbours on the mosaic