top of page
INOC2026
Thu, Apr 23
|HEC
I will be presenting our work called "On Robust Min-Cut and Max-Flow under Uncertainty" at Liège.
Biletler satışta değil
Diğer etkinlikleri görTime & Location
Apr 23, 2026, 7:00 PM – 11:00 PM
HEC, Rue Louvrex 14, 4000 Liège, Belçika
About the event
Abstract: The max–flow min–cut theorem links the maximum flow value
in a network to the capacity of the minimum s-t cut, with optimal
solutions corresponding to binary graph partitions. When arc ca-
pacities are uncertain, however, this integrality property may fail.
This paper studies robust max–flow and min–cut formulations
under uncertainty, with a focus on ellipsoidal uncertainty sets
bottom of page