Resource constrained shortest paths

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

Volumn 1879, Issue , 2000, Pages 326-337

  Mehlhorn, Kurt ^a   Ziegelmann, Mark ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; GRAPH THEORY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; ALGORITHMS;

COMBINATORIAL ALGORITHM; CONSTRAINED SHORTEST PATH; EXACT ALGORITHMS; LEAST COST PATH; LINEAR PROGRAMMING RELAXATION; LP RELAXATION; POLYNOMIAL-TIME; RESOURCE CONSTRAINT;

APPROXIMATION ALGORITHMS;

EID: 84927133516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_30     Document Type: Article

References (17)

1. Y. Aneja, V. Aggarwal, and K. Nair. Shortest chain subject to side conditions. Networks, 13:295–302, 1983.
2. R. Anderson and S. Sobti. The table layout problem. In Proc. 15th SoCG, pages 115–123, 1999.
3. J. Beasley and N. Christofides. An Algorithm for the Resource Constrained Shortest Path Problem. Networks, 19:379–394, 1989.
4. W. Cook, W. Cunningham, W. Pulleyblank, and A. Shrijver. Combinatorial Optimization. John Wiley & Sons, Inc, 1998.
5. K. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental construction. Computational Geometry: Theory and Applications, 3(4):185–212, 1993.
6. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652–673, 1999.
7. P. Hansen. Bicriterion path problems. In G. Fandel and T. Gal, editors, Multiple Criteria Decision Making: Theory and Application, pages 109–127. Springer verlag, Berlin, 1980.
8. R. Hassin. Approximation Schemes for the Restricted Shortest Path Problem. Math. Oper. Res., 17(1):36–42, 1992.
9. M. Henig. The shortest path problem with two objective functions. European Journal of Operational Research, 25:281–291, 1985.
10. G. Handler and I. Zang. A Dual Algorithm for the Constrained Shortest Path Problem. Networks, 10:293–310, 1980.
11. V. Jiminez and A. Marzal. Computing the k shortest paths. A new algorithm and an experimental comparison. In Proc. 3rd Workshop on Algorithm Engineering (WAE99), LNCS 1668, pages 25–29, 1999.
12. H. Joksch. The Shortest Route Problem with Constraints. Journal of Mathematical Analysis and Application, 14:191–197, 1966.
13. K. Mehlhorn and S. Näher. The LEDA platform for combinatorial and geometric computing. Cambridge University Press, 1999.
14. K. Mehlhorn, S. Näher, M. Seel, and C. Uhrig. The LEDA User Manual. Max-Planck-Institut für Informatik. http://www.mpi-sb.mpg.de/LEDA.
15. M. Minoux and C. Ribero. A heuristic approach to hard constrained shortest path problems. Discrete Applied Mathematics, 10:125–137, 1985.
16. C. Phillips. The Network Inhibition Problem. In 25th ACM STOC, pages 776–785, 1993.
17. A. Warburton. Approximation of pareto-optima in multiple-objective shortest path problems. Operations Research, 35(1):70–79, 1987.