A label correcting approach for solving bicriterion shortest-path problems

Computers and Operations Research

Volumn 27, Issue 6, 2000, Pages 507-524

  Skriver, A J V ^a   Andersen, K A ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Bicriterion; MCDM; MCIP; Random networks; Shortest path

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; RANDOM PROCESSES;

BICRITERION SHORTEST PATH PROBLEMS; LABEL CORRECTING ALGORITHMS;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0034003285     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00037-4     Document Type: Article

References (9)

1. Erkut E, Verter V. Modeling of transport risk for hazardous materials. Operations Research 1998;46:625-42.
2. Huarng F, Pulat PS, Shih L. A computational comparison of some bicriterion shortest path algorithms. Journal of the Chinese Institution of Industrial Engineers 1996;13:121-5.
3. Brumbaugh-Smith J, Shier D. An empirical investigation of some bicriterion-shortest path algorithms. European Journal of Operational Research 1989;43:216-24.
4. Steuer RE. Multiple criteria optimization: theory, computation, and application New York: Wiley, 1986.
5. Climaco JCN, Martins EQV. A bicriterion shortest path algorithm. European Journal of Operational Research 1982;11:399-404.
6. Mote J, Murthy I, Olson DL. A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 1991;53:81-92.
7. Hansen P. Bicriterion path problems. In: Multiple criteria decision making: theory and applications. Heidelberg: Springer, 1980:109-27.
8. Tung CT, Chew KL. A bicriterion Pareto-optimal path algorithm. Asia-Pacific Journal of Operations Research 1988;5:166-72.
9. Andersen, KA, Jörnsten K, Lind M. On bicriterion spanning trees: an approximation. Computers and Operations Research 1996;23:1171-82.