Dynamic Network Flows with Uncertain Costs belonging to Interval

This paper considers minimum cost flow problem in dynamic networks with uncertain costs. First, we present a short introduction of dynamic minimum cost flow. Then, we survey discrete and continuous dynamic minimum cost flow problems, their properties and relationships between them. After that, the minimum cost flow problem in discrete dynamic network with uncertainty in the cost vector is considered such that the arc cost can be changed within an interval. Finally, we propose an algorithm to find the optimal solution of the proposed model.