An algorithm for ranking paths that may contain cycles-Reference-Cited by-同舟云学术

An algorithm for ranking paths that may contain cycles

Published:1984-10 Issue:1 Volume:18 Page:123-130
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

de Queirós Vieira Martins Ernesto

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. On the determination of the nondominated paths in a multiobjective network problem;Climaco;Methods in Operations Research,1981

2. A simplex based algorithm for the minimal average speed path problem;Climaco,1981

3. Shortest route methods: 1. Reaching, pruning and buckets;Denardo;Operations Research,1979

4. A computational analysis of alternative algorithms and labeling techniques for finding shortest trees;Dial,1977

5. An appraisal of some shortest paths algorithms;Dreyfus;Operations Research,1969

Cited by 59 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Label-Setting Algorithm for Multi-Destination K Simple Shortest Paths Problem and Application;Algorithms;2024-07-25

2. Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends;Algorithms;2024-05-22

3. Finding K dissimilar paths: Single-commodity and discretized flow formulations;Computers & Operations Research;2022-11

4. Graph transformation and shortest paths algorithms for finite Markov chains;Physical Review E;2021-06-08

5. The Steiner bi-objective shortest path problem;EURO Journal on Computational Optimization;2021