On finding dissimilar paths-Reference-Cited by-同舟云学术

On finding dissimilar paths

Published:2000-03 Issue:2 Volume:121 Page:232-246
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Akgün Vedat,Erkut Erhan,Batta Rajan

Publisher

Elsevier BV

Subject

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

Reference15 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ

2. Akgün, V., Erkut, E., Batta, R., 1997. On finding dissimilar paths. Research report 97/3. Faculty of Business, University of Alberta, Edmonton

3. The discrete p-dispersion problem;Erkut;European Journal of Operational Research,1990

4. A comparison of p-dispersion heuristics;Erkut;Computers & Operations Research,1994

5. Erkut, E., Verter, V., forthcoming. Modeling of transport risk for hazardous materials. Operations Research

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

1. A Just-In-Time Framework for Continuous Routing;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Congestion-Mitigating Spatiotemporal Routing in Road Networks;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Efficient Alternative Route Planning in Road Networks;IEEE Transactions on Intelligent Transportation Systems;2024

4. Almost disjoint paths and separating by forbidden pairs;Theoretical Computer Science;2024-01

5. Route Optimization Under Flood Conditions;2024