A class of chance constrained network optimization problems

AbstractIn this paper, a stochastic version of each of the maximum flow and the minimum cost flow problems for a directed single commodity network, where the flow of units along each arc of the network forms a homogeneous Poisson process, are formulated as two chance constrained optimization problems and are solved based on the classical labeling algorithm and the primal-dual algorithm, respectively