Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Burton and Ph.L. Toint, “On an instance of the inverse shortest path problem,”Mathematical Programming 53 (1992) 45–61.
R.M. Downs and D. Stea,Maps in Minds (Harper and Row, New York, 1977).
D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs,”Mathematical Programming 27 (1983) 1–33.
D.B. Johnson, “Efficient algorithms for shortest paths in sparse networks,”Journal of the Association for Computing Machinery 24 (1977) 1–13.
A. Tarantola and B. Valette, “Generalized nonlinear inverse problems solved using the least square criterion,”Reviews of Geophysics and Space Physics 20 (1982) 219–232.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burton, D., Toint, P.L. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming 63, 1–22 (1994). https://doi.org/10.1007/BF01582056
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582056