The inverse shortest paths problem with upper bounds on shortest paths costs
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costsMathematical Programming, 1994
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- An Auction Algorithm for Shortest PathsSIAM Journal on Optimization, 1991
- Route Choice: Wayfinding in Transport NetworksPublished by Springer Nature ,1990
- Shortest route algorithm with movement prohibitionsTransportation Research Part B: Methodological, 1985
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958