Incremental network design with shortest paths

被引：38
|
作者：
Baxter, Matthew [1 ]
Elgindy, Tarek [1 ]
Ernst, Andreas T. [1 ]
Kalinowski, Thomas [2 ]
Savelsbergh, Martin W. P. [2 ]
机构：
[1] CSIRO, CSIRO Math Informat & Stat, Canberra, ACT, Australia
[2] Univ Newcastle, Callaghan, NSW 2308, Australia
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2014年 / 238卷 / 03期
关键词：
Network design; Multi-period; Heuristic; Approximation algorithm; Integer programming; INFRASTRUCTURE SYSTEMS; RESTORATION;
D O I：
10.1016/j.ejor.2014.04.018
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：675 / 684
页数：10
相关论文
共 50 条
  • [1] AN INCREMENTAL ALGORITHM FOR IDENTIFICATION OF LONGEST (SHORTEST) PATHS
    KUNDU, S
    INTEGRATION-THE VLSI JOURNAL, 1994, 17 (01) : 25 - 31
  • [2] Incremental distance products via faulty shortest paths
    Weimann, Oren
    Yuster, Raphael
    INFORMATION PROCESSING LETTERS, 2020, 161
  • [3] Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis
    Khopkar S.S.
    Nagi R.
    Nikolaev A.G.
    Bhembre V.
    Khopkar, Sushant S. (skhopkar@buffalo.edu), 1600, Springer-Verlag Wien (04): : 1 - 20
  • [4] Shortest Paths in a Hybrid Network Model
    Augustine, John
    Hinnenthal, Kristian
    Kuhn, Fabian
    Scheideler, Christian
    Schneider, Philipp
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1280 - 1299
  • [5] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    HU, TC
    OPERATIONS RESEARCH, 1968, 16 (01) : 91 - &
  • [6] Network orientation via shortest paths
    Silverbush, Dana
    Sharan, Roded
    BIOINFORMATICS, 2014, 30 (10) : 1449 - 1455
  • [7] Shortest Paths in a Hybrid Network Model
    Augustine, John
    Hinnenthal, Kristian
    Kuhn, Fabian
    Seheideler, Christian
    Schneider, Philipp
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1280 - 1299
  • [8] Shortest paths between shortest paths
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5205 - 5210
  • [9] SHORTEST PATHS, SINGLE ORIGIN-DESTINATION NETWORK DESIGN, AND ASSOCIATED POLYHEDRA
    MAGNANTI, TL
    MIRCHANDANI, P
    NETWORKS, 1993, 23 (02) : 103 - 121
  • [10] HUS DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    YEN, JY
    OPERATIONS RESEARCH, 1971, 19 (04) : 983 - &
12345