DeepRead
Cover of Linear network optimization

Linear network optimization

Dimitri P. Bertsekas · 1991

Mathematics and physics › Numerical and matrix computation

#11,477 most recommended

About the book

Linear network optimization covers problems that can be modeled as flows on networks, such as shortest paths, maximum flow, assignment, and minimum-cost flow. It concentrates on algorithms for these problems, with attention to their theory and to computer implementation. The book presents duality, particularly dual ascent and relaxation methods, as the organizing principle for solving linear network problems efficiently, and it treats these methods as practical alternatives to general linear programming. It makes the case that specialized network algorithms, including the auction approach, can be both theoretically sound and fast in computational tests. It also supports this with working codes and experimental comparisons.

Written by Claude from what it knows of this book.

What Hacker News says 33% recommend · 0% critical

00.512011201220142016201820192011 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.

  • 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
1991
ISBN
9780262023344
Editions known
4 at Open Library
Open Library
OL2021796W

AlgorithmsLinear programmingMathematical optimizationNetwork analysis (Planning)

Explore in the mosaic

Read next: its neighbours on the mosaic