ON THE USE OF AN INVERSE SHORTEST PATHS ALGORITHM FOR RECOVERING LINEARLY CORRELATED COSTS

被引：70

作者：

BURTON, D

TOINT, PL

机构：

[1] FAC UNIV NOTRE DAME PAIX,DEPT MATH,61 RUE BRUXELLES,B-5000 NAMUR,BELGIUM

[2] FAC UNIV NOTRE DAME PAIX,DEPT MATH,BELGIAN NATL FUND SCI RES,B-5000 NAMUR,BELGIUM

来源：

MATHEMATICAL PROGRAMMING | 1994年 / 63卷 / 01期

关键词：

GRAPH THEORY; SHORTEST PATHS; INVERSE PROBLEMS; QUADRATIC PROGRAMMING; TRAFFIC MODELING;

D O I：

10.1007/BF01582056

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper considers the inverse shortest paths problem where arc costs are subject to correlation constraints. The motivation for this research arises from applications in traffic modelling and seismic tomography. A new method is proposed for solving this class of problems. It is constructed as a generalization of the algorithm presented in Burton and Toint (Mathematical Programming 53, 1992) for uncorrelated inverse shortest paths. Preliminary numerical experience with the new method is presented and discussed.

引用

页码：1 / 22

页数：22

共 5 条

[1] ON AN INSTANCE OF THE INVERSE SHORTEST PATHS PROBLEM
BURTON, D
TOINT, PL
[J]. MATHEMATICAL PROGRAMMING, 1992, 53 (01) : 45 - 61
[2] Downs R.M., 1977, MAPS MINDS REFLECTIO, DOI [10.2307/215060, DOI 10.2307/215060]
[3] A NUMERICALLY STABLE DUAL METHOD FOR SOLVING STRICTLY CONVEX QUADRATIC PROGRAMS
GOLDFARB, D
IDNANI, A
[J]. MATHEMATICAL PROGRAMMING, 1983, 27 (01) : 1 - 33
[4] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS
JOHNSON, DB
[J]. JOURNAL OF THE ACM, 1977, 24 (01) : 1 - 13
[5] GENERALIZED NON-LINEAR INVERSE PROBLEMS SOLVED USING THE LEAST-SQUARES CRITERION
TARANTOLA, A
VALETTE, B
[J]. REVIEWS OF GEOPHYSICS, 1982, 20 (02) : 219 - 232

← 1 →