On an instance of the inverse shortest paths problem

The inverse shortest paths problem in a graph is considered, that is, the problem of recovering the arc costs given some information about the shortest paths in the graph. The problem is first motivated by some practical examples arising from applications. An algorithm based on the Goldfarb-Idnani method for convex quadratic programming is then proposed and analyzed for one of the instances of the problem. Preliminary numerical results are reported.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[3]  Jörn Behrens,et al.  Inversion of seismic data using tomographical reconstruction techniques for investigations of laterally inhomogeneous media , 1984 .

[4]  John H. Woodhouse,et al.  Mapping the upper mantle: Three‐dimensional modeling of earth structure by inversion of seismic waveforms , 1984 .

[5]  A. Conn,et al.  A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances , 1980 .

[6]  D.A. Calahan,et al.  Computer solution of large positive definite systems , 1982, Proceedings of the IEEE.

[7]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[8]  A. Conn,et al.  A second-order method for solving the continuous multifacility location problem , 1982 .

[9]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[10]  Paul H. Calamai,et al.  A projected newton method forlp norm location problems , 1987, Math. Program..

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  A. Tarantola.  Inverse problem theory : methods for data fitting and model parameter estimation , 1987 .

[13]  M. Powell.  On the quadratic programming algorithm of Goldfarb and Idnani , 1985 .

[14]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .