.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Network design
Multi-period
Heuristic
Approximation algorithm
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
21<sup>st</sup> Century challenges of clean energy and global warming-can energy storage systems meet these issues?.png)
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and Applications
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and ApplicationsIF0
PREAI
分享收藏分享收藏Estimation in Forest Yield Models Using Composite Link Functions with Random EffectsBiometrics
BiometricsIF0
PREAI
分享收藏Theoretical Analysis on the Mismatch Influence of Displaced Phase Center Multiple-beam SAR Systems
PREAI
分享收藏分享收藏
Sensitivity to Carcinogenesis in Nude Mice: Skin Tumors Caused by Transplacental Exposure to EthylnitrosoureaScience
ScienceIF0
PREAI
分享收藏
查看更多内容