Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐
stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to …

In this paper the Robust Network Loading problem with splittable flows and dynamic routing
under polyhedral uncertainty for the demands is considered. Polyhedral results for the …

In this paper we consider the problem of optimal partitioning of a traffic demand polytope
using a hyperplane. In our model all possible demand matrices belong to a polytope. The …

We study a class of robust network design problems motivated by the need to scale core
networks to meet increasingly dynamic capacity demands. Past work has focused on one of …

Motivé par les applications concernantes les réseaux de communication, le dessein des
réseaux robustes applique les méthodes très réusies provenant de l'optimisation robuste. La …

Designing a network able to route a set of non-simultaneous demand vectors is an important
problem arising in telecommunications. In this paper, we compare the optimal capacity …

Given the dynamic nature of traffic, we investigate the variant of robust network design
where we have to determine the capacity to reserve on each link so that each demand …

This article provides an overview about the main results and findings developed in the
dissertation of the author [8]. In this thesis, we develop methods in mathematical optimization …

We experiment with an alternative routing scheme for the robust network loading problem
with demand uncertainty. Named k‐adaptive, it is based on the fact that the decision‐maker …

This paper considers a special case of the robust network design problem where the
dominant extreme points of the demand polyhedron have a disjoint support. In this case …