DeepRead
Cover of Integer and combinatorial optimization

Integer and combinatorial optimization

George L. Nemhauser · 1988

Mathematics and physics › Numerical and matrix computation

#7,245 most recommended

About the book

The book covers integer and mixed-integer linear programming and combinatorial optimization, a field where decision variables are restricted to integers or binary values. It spans problem formulation, the polyhedral theory behind these models, and the algorithms used to solve them, including cutting planes, branch and bound, and dynamic programming. It is written as a broad reference for researchers and graduate students in operations research, computer science, and applied mathematics. Its central claim is that many discrete optimization problems can be unified by writing them as linear programs with some or all variables required to be integral. The quality of such a formulation depends on the shape of the feasible region, so the book stresses finding strong formulations and understanding their convex hulls, facets, and valid inequalities. It presents the resulting polyhedral structure as the basis for both the theory of these problems and practical solution methods.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

024201320162018202020222013 peak · 3
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.

  • 4 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
1988
ISBN
9780471359432
Editions known
14 at Open Library
Open Library
OL4984031W

Combinatorial optimizationComputer science, mathematicsDiscrete mathematicsInteger programmingMathematical optimizationMathematics

Explore in the mosaic

Read next: its neighbours on the mosaic