Note on “A new bidirectional algorithm for shortest paths”-Reference-Cited by-同舟云学术

Note on “A new bidirectional algorithm for shortest paths”

Published:2010-12 Issue:2 Volume:207 Page:1140-1141
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pijls Wim,Post Henk

Publisher

Elsevier BV

Subject

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

Reference3 articles.

1. A.V. Goldberg, C. Harrelson, Computing the shortest path: A∗ search meets graph theory, in: 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’05), 2005.

2. A new bidirectional search algorithm with shortened postprocessing;Pijls;European Journal of Operational Research,2009

3. W. Pijls, H. Post, Yet another bidirectional algorithm for shortest paths, Technical report 2009–2010, Econometric Institute, Erasmus University Rotterdam, available at: .

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

1. Exploring multi-modal evacuation strategies for a landlocked population using large-scale agent-based simulations;International Journal of Geographical Information Science;2022-05-16

2. Drone-Aided Path Planning for Unmanned Ground Vehicle Rapid Traversing Obstacle Area;Electronics;2022-04-13

3. MM: A bidirectional search algorithm that is guaranteed to meet in the middle;Artificial Intelligence;2017-11

4. Research on Gas Station Selection Support System with Given Refueling Volume;Advanced Materials Research;2012-01