A new bidirectional search algorithm with shortened postprocessing-Reference-Cited by-同舟云学术

A new bidirectional search algorithm with shortened postprocessing

Published:2009-10 Issue:2 Volume:198 Page:363-369
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,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. On a routing problem;Bellman;Quarterly of Applied Mathematics,1958

2. Bidirectional heuristic search again;de Campeaux;JACM,1983

3. A note on two problems in connexion with graphs;Dijkstra;Numerische Mathematik,1959

4. An appraisal of some shortest-path algorithms;Dreyfus;Operations Research,1969

5. L.R. Ford, Network Flow Theory, Technical Report P-923 Rand Corporation, Santa Monica CA, 1956.

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

1. The Quest for Efficient Search Algorithms: Uninformed vs Informed Approaches;2024 Second International Conference on Emerging Trends in Information Technology and Engineering (ICETITE);2024-02-22

2. Dynamic Path Optimization Based on Improved Ant Colony Algorithm;Journal of Advanced Transportation;2023-04-17

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

4. Exact Routing in Large Road Networks Using Contraction Hierarchies;Transportation Science;2012-08

5. Note on “A new bidirectional algorithm for shortest paths”;European Journal of Operational Research;2010-12