The maximum flow problem of uncertain network

The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. The main purpose of this paper is to solve the maximum flow in an uncertain network by under the framework of uncertainty theory.