Home

Books
AudioBooks

subscription titles

Book
Audio
Photos
Reviews
Comments
Quotes

Add book

Book

network flows

by ravindra k ahuja

Business & Investing » Management & Leadership

Added by: Celine Hau "m...

Users who like this book

txt fb2 rtf pdf epub pdb

Description:

The book is intended for those who work with network flows, optimization and network programming as well as everyone who is interested in these topics and want to broaden their knowledge. This is a study book representing an introduction to network flow from the classical and modern points of view. Network Flows contains a number of theories, algorithms and applications addressing the problems of the shortest path, maximum flow and minimum cost flow.

get subscription

Read an excerpt:

...using the network. Moreover, the solution of the maximum flow problem with capacity data chosen judiciously establishes other performance measures for a network. For example, what is the minimum number of nodes whose removal from the network destroys all paths joining a particular pair of nodes? Or, what is the maximum number of node disjoint paths that join this pair of nodes? These and similar reliability measures indicate the robustness of the network to failure of its components. In this section, we discuss several algorithms for computing the maximum flow between two nodes in a network. We begin by introducing a basic labeling algorithm for solving the maximum flow problem. The validity of these algorithms rests upon the celebrated max-flow min-cut theorem of network flows. This remarkable theorem has a number of surprising implications in machine and vehicle scheduling, communication systems planning and several other application domains. We then consider improved versions of the...