DeepRead
Cover of Combinatorial Optimization

Combinatorial Optimization

Alexander Schrijver · 2003

Programming and computer science › Algorithms and coding interviews

#11,552 most recommended

About the book

A comprehensive treatment of combinatorial optimization, covering problems on graphs, networks, matchings, flows, matroids, and submodular functions. It spans classical algorithms, polyhedral combinatorics, and the complexity of these problems, in three volumes. The book's central idea is that many discrete optimization problems can be understood through linear programming: describing the convex hull of their feasible solutions by linear inequalities makes them solvable in polynomial time. It develops this link through matching, flow, and matroid theory, and uses separation and the ellipsoid method to connect polyhedral descriptions with efficient algorithms. It also presents the theory as a unified framework in which classical results follow from a few general principles.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420112015202020242011 peak · 2
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 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

Details

First published
2003
ISBN
9781118033142
Editions known
8 at Open Library
Open Library
OL5096223W

AlgorithmsCombinatorial optimization

Explore in the mosaic

Read next: its neighbours on the mosaic