SOLVING ROBUST VARIANTS OF INTEGER FLOW PROBLEMS WITH UNCERTAIN ARC CAPACITIES

This paper deals with robust optimization and networkflows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with ATP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. The accuracy of the proposed algorithm is verified by experiments.