Network Flows: Theory, Algorithms, and Applications

Review of the book
Flow in networks is one of the operational research fields that students and researchers use in their practice and research. This topic is used in various fields such as chemistry, physics, computer networks, public policies, social systems, scheduling and routing and civil engineering, industries and transportation. In the writing of this book, an effort has been made to take into account the wide range of audiences and prepare a comprehensive and comprehensive book that includes theory, solutions and numerous examples. This book has been taught as a reference in universities around the world for the course of network theory and similar courses.

Table of Contents
The topics discussed in this book are as follows:
1. Introduction
2- Paths, trees and rounds
3- Algorithm design and analysis
4- The shortest path: labeling method
5- Maximum flow problem: basic idea
6- Maximum flow problem: polynomial algorithm
7- Maximum flow problem: additional points
8- Flow problem with minimum cost: basic algorithms
9- Flow problem with minimum cost: polynomial algorithm
10- Flow problem with minimum cost: simplex algorithm
11- Matching and allocation
12- Minimal cover tree
13- Convex cost flow problem
14- The general problem of flow
15- Lagrangian relaxation and network optimization
16- Multi-commodity flow
17- Algorithms and calculation test method
18- Applications of the network problem
19- Data structure
20- Complexity in issues
21- Linear programming