In this study, we consider the robust uncapacitated multiple allocation p-hub median
problem under polyhedral demand uncertainty. We model the demand uncertainty in two …

Over the last decades, network design problems (NDPs) have been one of the most
investigated combinatorial optimisation problems that are still catching the interest of both …

In this study, we consider a capacitated multiple allocation hub location problem with hose
demand uncertainty. Since the routing cost is a function of demand and capacity constraints …

Traffic in communication networks fluctuates heavily over time. Thus, to avoid capacity
bottlenecks, operators highly overestimate the traffic volume during network planning. In this …

This paper proposes a distributionally robust joint chance constrained (DRJCC)
programming approach to optimize the service network design (SND) problem under …

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 …

We estimate potential energy savings in IP-over-WDM networks achieved by switching off
router line cards in low-demand hours. We compare three approaches to react on dynamics …

We consider a network design problem (NDP) under random demand with unknown
distribution for which only a small number of observations are known. We design arc …

Uncertain traffic plays an important role in the design of long-term optical networks. The
performance of these networks is highly dependent on the way the wavelength converter …