Non-additive Shortest Paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 822-834

  Tsaggouris, George ^a,b   Zaroliagis, Christos ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; GRAPH THEORY;

EXACT ALGORITHMS; LAGRANGIAN RELAXATION; MULTI-ATTRIBUTES; NON-DECREASING FUNCTIONS; NONLINEAR COST FUNCTIONS; OPTIMAL PATHS; POLYNOMIAL ALGORITHM; SHORTEST PATH;

ALGORITHMS;

EID: 33646727766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_72     Document Type: Article

References (14)

1. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows, Prentice-Hall, 1993.
2. J. Beasley and N. Christofides, "An Algorithm for the Resource Constrained Shortest Path Problem", Networks 19 (1989), pp. 379-394.
3. E.W. Cheney, Introduction to Approximation Theory, McGraw-Hill, NY, 1966.
4. S. Gabriel and D. Bernstein, "The Traffic Equilibrium Problem with Nonadditive Path Costs", Transportation Science 31:4(1997), pp. 337-348.
5. S. Gabriel and D. Bernstein, "Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models", Comp. & Math. Organiz. Theory 6 (2000).
6. G. Handler and I. Zang, "A Dual Algorithm for the Constrained Shortest Path Problem", Networks 10(1980), pp. 293-310.
7. M. Henig, "The Shortest Path Problem with Two Objective Functions", European Journal of Operational Research 25(1985), pp. 281-291.
8. D. Hensen and T. Truong, "Valuation of Travel Times Savings", Journal of Transport Economics and Policy (1985), pp. 237-260.
9. K. Mehlhorn and M. Ziegelmann, "Resource Constrained Shortest Paths", in Algorithms - ESA 2000, LNCS 1879 (Springer-Verlag 2000), pp. 326-337.
10. P. Mirchandani and M. Wiecek, "Routing with Nonlinear Multiattribute Cost Functions", Applied Mathematics and Computation 54(1993), pp. 215-239.
11. C. Papadimitriou and M. Yannakakis, "On the Approximability of Trade-offs and Optimal Access of Web Sources", in Proc. 41st FOCS 2000, pp. 86-92.
12. K. Scott and D. Bernstein, "Solving a Best Path Problem when the Value of Time Function is Nonlinear", preprint 980976 of the Transport. Research Board, 1997.
13. G. Tsaggouris and C. Zaroliagis, "Non-Additive Shortest Paths", Tech. Report TR-2004/03/01, Computer Technology Institute, Patras, March 2004.
14. F.B. Zhan and C.E. Noon, "Shortest Path Algorithms: An Evaluation using Real Road Networks", Transportation Science 32:1(1998), pp. 65-73.