Computation of the reverse shortest-path problem

Journal of Global Optimization

Volumn 25, Issue 3, 2003, Pages 243-261

  Zhang, Jianzhong ^a   Lin, Yixun ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867938508     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1022429905385     Document Type: Article

References (17)

1. R. Bellman 1958 On a routing problem Quar. Appl. Math. 16 87 90
2. O. Berman D.I. Ingco A.R. Odoni 1992 Improving the location of minisum facilities through network modification Annals of Oper. Res. 40 1 16
3. D. Burton P. Toint 1992 On an instance of the inverse shortest paths problem Math. Program. 53 45 61
4. D. Burton P. Toint 1994 On the use of an inverse shortest paths algorithm for recovering linearly correlated costs Math. Program. 63 1 22
5. Burton, D.; Pulleyblank, W.R. and Toint, Ph.L. (1997), The inverse shortest paths problem with upper bounds on shortest paths costs, Lecture Notes in Econom. and Math. System 450, 156-171.
6. M. Cai X. Yang J. Zhang 1999 The complexity analysis of the inverse center location problem J. Global Optimization 15 213 218
7. K.U. Drangmeister S.O. Krumke M.V. Marathe H. Noltemeier S.S. Ravi 1998 Modifying edges of a network to obtain short subgraphs Theoretical Computer Science 203 91 121
8. Dreyfus, S.E. and Law, A.M. (1977), The Art and Theory of Dynamic Programming, Academic Press, New York.
9. D.R. Fulkerson G.C. Harding 1977 Maximizing the minimum source-sink path subject to a budget constraint Math. Program. 13 116 118
10. Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the theory of NP-Completeness, Freeman, San Francisco, CA.
11. Lawler, E.L. (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
12. Papadimitriou, C.H. and Steiglitz, K. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
13. Tarjan, R.E. (1985), Shortest path algorithms, Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich.; 1984), Wiley, New York, 753-759.
14. J. Zhang Z. Ma C. Yang 1995 A column generation method for inverse shortest path problem ZOR Math. Methods of Oper. Res. 41 347 358
15. J. Zhang Z. Ma 1996 A network flow method for solving some inverse combinatorial optimization problems Optimization 37 59 72
16. J. Zhang Z. Liu Z. Ma 2000 Some reverse location problem European J. Oper. Res. 124 77 88
17. Zhang, J.; Yang, X. and Cai, M. (1999), Reverse center location problem, Lecture Notes in Computer Science 1741, 279-294.