Name
Abstract | ||
|---|---|---|
•We study the optimal choice and timing of network expansions.•We introduce a new class of incremental network design problems.•We develop a 4-approximation algorithm for incremental network design with shortest paths.•Analysis shows that coordinating timing of expansions increases the complexity of network design. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ejor.2014.04.018 | European Journal of Operational Research |
Keywords | Field | DocType |
Network design,Multi-period,Heuristic,Approximation algorithm,Integer programming | Approximation algorithm,Mathematical optimization,Heuristic,Network planning and design,Computer science,Integer programming,Heuristics | Journal |
Volume | Issue | ISSN |
238 | 3 | 0377-2217 |
Citations | PageRank | References |
14 | 0.80 | 17 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Baxter | 1 | 14 | 0.80 |
| Tarek Elgindy | 2 | 14 | 0.80 |
| Andreas T. Ernst | 3 | 1198 | 82.51 |
| Thomas Kalinowski | 4 | 149 | 22.96 |
| Martin Savelsbergh | 5 | 2624 | 190.83 |