Abstract

<P><B></B> Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. <B></B> It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. <B></B> For professionals working with network flows, optimization, and network programming. </P>

Links and resources

Tags

community

  • @asalber
  • @bfields
  • @machinelearning
  • @jmm
  • @dblp
  • @pcbouman
@pcbouman's tags highlighted