On the sum-max bicriterion path problem

Computers and Operations Research

Volumn 25, Issue 12, 1998, Pages 1043-1054

  Pelegrín, Bias ^a   Fernández, Pascual ^a  

^a UNIVERSITY OF MURCIA   (Spain)

Author keywords

Bicriteria analysis; Network optimization; Quickest paths

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; OPTIMIZATION;

BICRITERIA ANALYSIS; QUICKEST PATH PROBLEMS (QPP); SUM-MAX BICRITERION PATH PROBLEMS (SMBPP);

OPERATIONS RESEARCH;

EID: 0032353840     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00036-7     Document Type: Article

References (20)

1. Aneja, Y. P. and Nair, K. P. K., The constrained shortest path problem. Naval Research Logistics Quarterly, 1978, 25, 549-555.
2. Boffey, T. B., Multiobjective routing problems. TOP, 1995, 3(2), 167-203.
3. Chen, Y. L., An algorithm for finding the k quickest paths in a network. Comput. Oper. Res., 1993, 20, 59-65.
4. Chen, Y. L. and Chin, Y. H., The quickest path problem. Comput. Oper. Res., 1990, 17, 153-161.
5. Chen, G. H. and Hung, Y. C., On the quickest path problem. Inf. Process Lett., 1993, 46, 125-128.
6. Chen, G. H. and Hung, Y. C., Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput. Oper. Res., 1994, 21, 113-118.
7. Climaco, J. C. N. and Martins, E. Q. V., A bicriterion shortest path algorithm. EJOR, 1982, 11, 399-404.
8. Current, J. R., Revelle, C. S. and Cohon, J. L., An interactive approach to identify the best compromise solution for two objective shortest path problems. Comput. Oper. Res., 1990, 17(2), 187-198.
9. Deo, N. and Pang, C. Y., Shortest path problems: taxonomy and annotation. Networks, 1984, 14, 257-323.
10. Gallo, G. and Pallottino, S., Shortest path methods: a unifying approach. Math. Prog. Study, 1986, 26, 38.
11. Gallo, G. and Pallottino, S., Shortest path algorithm. Ann. Oper. Res., 1988, 13, 3-79.
12. Hansen, P., Bicriterion path problems. In Multiple criteria decision making: Theory and Application., ed. G. Fandel and T. Gal. Lecture Notes in Economics and Mathematical Systems, 177, Springer-Verlag, pp. 109-127 (1980).
13. Henig, M. I., The shortest path problem with two objective functions. EJOR, 1985, 25, 281-291.
14. Hung, Y. C. and Chen, G. H., On the quickest path problem. Lecture Notes in Comput. Sci., 1991, 497, 44-46.
15. Lee, D. T. and Papadopoulou, E., The all-pairs quickest path problem. Inf. Process Lett., 1993, 45, 261-267.
16. Mote, J., Murthy, I. and Olson, D. L., A parametric approach to solving bicriterion shortest path problems. EJOR, 1991, 53, 81-92.
17. Pelegrín, B. and Fernández, P., On a special class of optimal path problems. Oper. Res. Lett., (1996) submitted.
18. Pierce, A. R., Bibliography on algorithms for shortest path, shortest spanning tree, and related circuit routing problems (1956-1974). Networks, 1975, 5, 129-149.
19. Rosen, J. B., Sun, S. Z. and Xue, G. L., Algorithms for the quickest path problem and enumeration of quickest paths. Comput. Oper. Res., 1991, 18, 579-584.
20. White, D. J., The set of efficient solutions for multiple objective shortest path problems. Comput. Oper. Res., 1982, 9, 101-107.