.png){kind=icon}
.png){kind=icon}
Return
Incremental network design with shortest paths
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2014.04.018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, show that the simplest variant is NP-hard, analyze the worst-case performance of natural greedy heuristics, derive a 4-approximation algorithm, and conduct a small computational study. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Network design
Multi-period
Heuristic
Approximation algorithm
Integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W