Title: The Robust Network Loading Problem with Dynamic Routing
Author: Sarra Mattia
Abstract:
Given a graph and a set of traffic matrices, the Robust Network
Loading Problem (RNL) consists of choosing minimum cost integer
capacities for the edges, such that all the matrices can be routed
non-simultaneously on the network. The routing scheme is dynamic if we
can choose a (possibly) different routing for every matrix, it is
static if the routing must be the same for all the matrices. The flows
are unsplittable if each commodity must use a single path, they are
splittable if the flow for every commodity can be splitted along
several paths. In this talk the first exact (branch-and-cut) appoach
for the RNL with dynamic routing and splittable flows is presented.