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

@inproceedings{Pulleyblank1997TheIS,
title={The Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs},
author={William R. Pulleyblank and Ph. L. Toint},
year={1997}
}

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