We study network flow problems in an uncertain environment from the viewpoint of robust
optimization. In contrast to previous work, we consider the case that the network parameters …

Communities located in regions prone to natural and man-made disasters endure hardship
and financial loss in the face of these events. Investment to enhance infrastructure resilience …

We study the design of resilient single-commodity flow networks that can remain robust
against multiple concurrent edge failures. We model these failures as binary random …

In this paper, we introduce the randomized network interdiction problem that allows the
interdictor to use randomness to select arcs to be removed. We model the problem in two …

This paper introduces the hub location problem under interhub link failures, a hub location
problem in which activated interhub links may fail with a given probability. Two different …

Abstract We propose Linear Programming (LP)-based solution methods for network flow
problems subject to multiple uncertain arc failures, which allow finding robust optimal …

Abstract The Maximum Robust Flow problem asks for a flow on the paths of a network
maximizing the guaranteed amount of flow surviving the removal of any k arcs. We point out …

The vitality of an arc/node of a graph with respect to the maximum flow between two fixed
nodes s and t is defined as the reduction of the maximum flow caused by the removal of that …

In this work, we consider a class of risk-averse maximum weighted subgraph problems (R-
MWSP). Namely, assuming that each vertex of the graph is associated with a stochastic …

We present a new robust optimization model for the problem of maximizing the amount of
flow surviving the attack of an interdictor. Given some path flow, our model allows the …