Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

被引：22

作者：

Ramaswamy, R ^{[1
]}

Orlin, JB

Chakravarti, N

机构：

[1] Infosys Technol Ltd, Bangalore 561229, Karnataka, India

[2] MIT E40 147, Cambridge, MA 02139 USA

[3] Ortec Asia, Singapore 049712, Singapore

来源：

MATHEMATICAL PROGRAMMING | 2005年 / 102卷 / 02期

关键词：

sensitivity analysis; shortest path problem; bottleneck shortest path; maximum capacity path problem;

D O I：

10.1007/s10107-004-0517-8

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path.

引用

页码：355 / 369

页数：15

共 50 条

[1] Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Ramkumar Ramaswamy
James B. Orlin
Nilopal Chakravarti
[J]. Mathematical Programming, 2005, 102 : 355 - 369
[2] On the Shortest Path of Maximum Capacity
卜月华
[J]. 大学数学, 2000, (02) : 63 - 65
[3] Optimal shortest path set problem in undirected graphs
Zhang, Huili
Xu, Yinfeng
Wen, Xingang
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (03) : 511 - 530
[4] Optimal shortest path set problem in undirected graphs
Huili Zhang
Yinfeng Xu
Xingang Wen
[J]. Journal of Combinatorial Optimization, 2015, 29 : 511 - 530
[5] AN ANALYSIS OF STOCHASTIC SHORTEST-PATH PROBLEMS
BERTSEKAS, DP
TSITSIKLIS, JN
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (03) : 580 - 595
[6] SHORTEST PATH PROBLEMS IN HYDROGEOLOGY
THOMAS, RG
[J]. GROUND WATER, 1978, 16 (05) : 334 - 340
[7] A shortest path algorithm for real-weighted undirected graphs
Pettie, S
Ramachandran, V
[J]. SIAM JOURNAL ON COMPUTING, 2005, 34 (06) : 1398 - 1431
[8] Shortest path problems on stochastic graphs: a neuro dynamic programming approach
Baglietto, M
Battistelli, G
Vitali, F
Zoppoli, R
[J]. 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 6187 - 6193
[9] On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs
Ensor, Andrew
Lillo, Felipe
[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2018, 31 (02) : 527 - 538
[10] Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
Brandenburg, Franz J.
Cai, Mao-cheng
[J]. FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2009, 5598 : 4 - +

← 1 2 3 4 5 →