engleski

Solving robust variants of integer flow problems with uncertain arc capacities

This paper is concerned with robust optimization and with network flows. 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 NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. Accuracy of the proposed algorithm is verified by experiments.

Network flow ; Integer flow ; Robust optimization ; Algorithm

nije evidentirano