Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities
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 varian...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zagreb, Faculty of Transport and Traffic Sciences
2021-02-01
|
Series: | Promet (Zagreb) |
Subjects: | |
Online Access: | https://traffic.fpz.hr/index.php/PROMTT/article/view/3538 |