The Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs

  title={The Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs},
  author={William R. Pulleyblank and Ph. L. Toint},
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 nding a locally optimum solution is proposed, discussed and tested. 1 Belgian National Fund for Scienti c Research Department of Mathematics Facult es Universitaires ND de la Paix B-5000 Namur, Belgium 2 IBM T.J. Watson Research Center Yorktown Heights, USA 3 Department of… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 18 references

On an instance of the inverse shortest paths problem

Math. Program. • 1992
View 10 Excerpts
Highly Influenced

The shortest path method for seismic ray tracing in compli- cated media

T. J. Moser
Ph.D. Thesis, Rijksuniversiteit Utrecht • 1992
View 1 Excerpt

An Auction Algorithm for Shortest Paths

SIAM Journal on Optimization • 1991
View 1 Excerpt

Shortest path calculation of seismic rays

T. J. Moser
Geophysics, vol. 56, pp. 59{67 • 1991
View 1 Excerpt

Route Choice: Way nding in Transport Net- works

P.H.L. Bovy, E. Stern
Kluwer Academic Publishers, Dordrecht • 1990
View 1 Excerpt

Shortest route with movement prohibition

S. M. Easa
Transportation Research B, vol. 19, 3, pp. 197{208 • 1985
View 1 Excerpt

Mathematical problems of computerized tomography

Proceedings of the IEEE • 1983
View 1 Excerpt

Similar Papers

Loading similar papers…