Mattia, Sara (2010) The Robust Network Loading Problem with Dynamic Routing. Technical Report. Department of Computer and System Sciences Antonio Ruberti, Roma.
![[img]](http://eprints.bice.rm.cnr.it/style/images/fileicons/application_pdf.png)
|
PDF
TR_3_2010.pdf Download (404kB) |
Abstract
The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it is called static if the routing must be the same for all the matrices. The flows are unsplittable if each point-to-point demand (commodity) must use a single path, they are splittable if the flow for every commodity can be splitted along several paths. In this paper we present the first exact approach for solving the RNL problem with splittable flows and dynamic routing under polyhedral uncertainty for the demands. A branch-and-cut algorithm based on the capacity formulation of the problem defined by metric inequalities is developed, and polyhedral results are given. The separation problem is formulated as a bilevel programming problem and a corresponding single level problem is derived. Computational results are presented.
| Item Type: | Monograph (Technical Report) |
|---|---|
| Uncontrolled Keywords: | network design, robustness, branch-and-cut |
| Subjects: | 600 Tecnologia - Scienze applicate > 620 Ingegneria e attivita' affini > 629 Altri rami dell'ingegneria |
| Depositing User: | Sapienza Università di Roma Dipartimento di Ingegneria informatica, automatica e gestionale |
| Date Deposited: | 23 Mar 2010 |
| Last Modified: | 20 May 2010 12:03 |
| URI: | http://eprints.bice.rm.cnr.it/id/eprint/1439 |
Actions (login required)
 |
View Item |
