Models and Algorithm of Maximum Flow Problem in Uncertain Network

摘要

Network flow problem covers a wide range of engineering and management applications. The maximum flow problem is to find the maximum amount of flow from the source to the sink within a network. Different from the existing works, this paper investigates maximum flow problem in which all arc capacities of the network are uncertain variables. Some models of maximum flow problem with uncertain arc capacities are exhibited. And then, the algorithm for solving maximum flow problem is introduced. As an illustration, an example is provided to show the effectiveness of the algorithm.