Optimization Online


The Robust Network Loading Problem with Static Routing

Sara Mattia (sara.mattia***at***iasi.cnr.it)

Abstract: In this paper we address the problem of dimensioning the capacities on the edges of a network to allow the routing of uncertain demands. We show how to derive a capacity formulation for the problem with static routing. We present separation routines to be used within a branch-and-cut algorithm and then we test the proposed approach considering two uncertainty models for the demands: the hose polyhedron and the multiple interval model.

Keywords: Robust Network Design; Static Routing; Demand Uncertainty

Category 1: Network Optimization

Citation: IASI-CNR R.13-06 (2013)

Download: [PDF]

Entry Submitted: 08/20/2013
Entry Accepted: 08/20/2013
Entry Last Modified: 09/04/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society