The inverse shortest paths problem with upper bounds on shortest paths costs

被引：0

作者：

Burton, D ^{[1
]}

Pulleyblank, WR

Toint, PL

机构：

[1] SAMTECH, B-4000 Liege, Belgium

[2] IBM Corp, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA

[3] Fac Univ Notre Dame Paix, Dept Math, B-5000 Namur, Belgium

来源：

NETWORK OPTIMIZATION | 1997年 / 450卷

关键词：

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for finding a locally optimum solution is proposed, discussed and tested.

引用

页码：156 / 171

页数：16

共 50 条

[1] ON AN INSTANCE OF THE INVERSE SHORTEST PATHS PROBLEM
BURTON, D
TOINT, PL
MATHEMATICAL PROGRAMMING, 1992, 53 (01) : 45 - 61
[2] A variation of the inverse shortest paths problem
2001, Wuhan University of Technology (23):
[3] On an instance of the inverse shortest paths problem
Burton, D.
Toint, Ph.L.
Mathematical Programming, Series A, 1992, 53 (1-6): : 45 - 61
[4] Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
Bley, Andreas
NETWORKS, 2007, 50 (01) : 29 - 36
[5] Bounds and heuristics for the shortest capacitated paths problem
Costa, MC
Hertz, A
Mittaz, M
JOURNAL OF HEURISTICS, 2002, 8 (04) : 449 - 465
[6] Bounds and Heuristics for the Shortest Capacitated Paths Problem
Marie-Christine Costa
Alain Hertz
Michel Mittaz
Journal of Heuristics, 2002, 8 : 449 - 465
[7] Shortest paths between shortest paths
Kaminski, Marcin
Medvedev, Paul
Milanic, Martin
THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5205 - 5210
[8] THE LOWER BOUNDS ON DISTRIBUTED SHORTEST PATHS
RAMARAO, KVS
VENKATESAN, S
INFORMATION PROCESSING LETTERS, 1993, 48 (03) : 145 - 149
[9] Disjoint shortest paths problem
Discrete Appl Math, 2 (113-138):
[10] The disjoint shortest paths problem
Eilam-Tzoreff, T
DISCRETE APPLIED MATHEMATICS, 1998, 85 (02) : 113 - 138

← 1 2 3 4 5 →