TY - JOUR
AU - Marko Å poljarec
AU - Robert Manger
PY - 2021/02/05
Y2 - 2021/06/20
TI - Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities
JF - Promet - Traffic&Transportation
JA - PROMET
VL - 33
IS - 1
SE - Articles
DO - 10.7307/ptt.v33i1.3538
UR - https://traffic.fpz.hr/index.php/PROMTT/article/view/3538
AB - This paper deals with robust optimization and 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. The accuracy of the proposed algorithm is verified by experiments.
ER -