Heuristic search for one-to-many shortest path queries
From MaRDI portal
Publication:825009
DOI10.1007/s10472-021-09775-xzbMath1494.68257OpenAlexW3212530569MaRDI QIDQ825009
Roni Stern, Abdallah Saffidine, Ariel Felner, Meir Goldenberg
Publication date: 17 December 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-021-09775-x
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Inconsistent heuristics in theory and practice
- Lifelong planning \(\text{A}^*\)
- On the complexity of admissible search algorithms
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- Breadth-first heuristic search
- Searching for the M Best Solutions in Graphical Models
- Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
- Tie-Breaking Strategies for Cost-Optimal Best First Search
- Letter to the Editor—The kth Best Route Through a Network
- Generalized best-first search strategies and the optimality of A*
- Disjoint paths in a network
- Finding the k Shortest Paths
- The compressed differential heuristic
- Enhanced Partial Expansion A*
