Optimization Online


A comparison of routing sets for robust network design

Michael Poss(mjposs***at***gmail.com)

Abstract: 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 allocation costs for six routing sets: affine routing, volume routing and its two simplifications, the routing based on an unrestricted 2-cover of the uncertainty set, and the routing based on a cover delimited by a hyperplane.

Keywords: Network flows; Robust optimization; Network design; Routing set; Routing template

Category 1: Network Optimization

Citation: Optimization Letters, to appear.

Download: [PDF]

Entry Submitted: 07/24/2013
Entry Accepted: 08/01/2013
Entry Last Modified: 07/24/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