Optimization Online


Incremental Network Design with Shortest Paths

Tarek Elgindy(tarek.elgindy***at***csiro.au)
Martin W.P. Savelsbergh(martin.savelsbergh***at***newcastle.edu.au)
Thomas Kalinowski(thomas.kalinowski***at***uni-rostock.de)
Andreas T. Ernst(andreas.ernst***at***csiro.au)
Matthew Baxter(matthew.baxter***at***csiro.au)

Abstract: We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, we show that the simplest variant is NP-hard, we analyze the worst-case performance of natural greedy heuristics, and we derive a 4-approximation algorithm.

Keywords: Incremental network design, optimization, multi-period, approximation

Category 1: Network Optimization

Category 2: Applications -- Science and Engineering (Multidisciplinary Design Optimization )

Category 3: Combinatorial Optimization (Approximation Algorithms )


Download: [PDF]

Entry Submitted: 01/14/2013
Entry Accepted: 01/31/2013
Entry Last Modified: 01/14/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