Incremental network design with shortest paths

被引：39
|
作者：
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 条
  • [21] Estimate of Resource Distribution with the Shortest Paths in the Multiuser Network
    Malashenko, Yu E.
    Nazarova, I. A.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2022, 61 (04) : 599 - 610
  • [22] Shortest paths along urban road network peripheries
    Batac, Rene C.
    Cirunay, Michelle T.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 597
  • [23] ALGORITHMS FOR FINDING THE K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    NETWORKS, 1979, 9 (03) : 195 - 214
  • [24] Models and algorithms for shortest paths in a time dependent network
    Li, Yinzhen
    He, Ruichun
    Zhang, Zhongfu
    Gu, Yaohuang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2005, 5 : 319 - 328
  • [25] Estimate of Resource Distribution with the Shortest Paths in the Multiuser Network
    Yu. E. Malashenko
    I. A. Nazarova
    Journal of Computer and Systems Sciences International, 2022, 61 : 599 - 610
  • [26] Generating Data Model for the Public Service System Design from the OpenStreetMap: Network and the Shortest Paths
    Cebecauer, Matej
    MATHEMATICAL METHODS IN ECONOMICS (MME 2014), 2014, : 79 - 84
  • [27] Shortest paths on a polyhedron .1. Computing shortest paths
    Chen, JD
    Han, YJ
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 127 - 144
  • [28] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    arXiv, 2020,
  • [29] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 153 - 166
  • [30] A backward incremental shortest path algorithm for urban traffic network
    Li, Xiantong
    Wang, Jian
    ICIC Express Letters, 2015, 9 (09): : 2569 - 2575
12345