The inverse shortest paths problem with upper
bounds on shortest paths costs.
D. Burton, W. R. Pulleyblank, Ph. L. Toint
Report 93-3
Abstract. 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 finding a locally optimum
solution is proposed, discussed and tested.