scientific article

zbMath1297.05230MaRDI QIDQ2921666

Chris Harrelson, Andrew V. Goldberg

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Paths and cycles (05C38) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

Search for the best compromise solution on Multiobjective shortest path problem ⋮ Heuristic search for one-to-many shortest path queries ⋮ Uncertainties of sub-scaled supply and demand in agent-based mobility simulations with queuing traffic model ⋮ Bidirectional A* search on time-dependent road networks ⋮ A lower bound for the quickest path problem ⋮ Computing source-to-target shortest paths for complex networks in RDBMS ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Engineering graph-based models for dynamic timetable information systems ⋮ Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs ⋮ Computing the greedy spanner in linear space ⋮ Bidirectional A  ∗  Search for Time-Dependent Fast Paths ⋮ Algorithms for searching paths in huge graphs ⋮ Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Time-Dependent SHARC-Routing ⋮ A biobjective Dijkstra algorithm ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Space-efficient, fast and exact routing in time-dependent road networks ⋮ The compressed differential heuristic ⋮ OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Time-dependent SHARC-routing ⋮ Shortest-path queries in static networks ⋮ Approximate shortest paths guided by a small index ⋮ Solving the Time-Dependent Shortest Path Problem Using Super-Optimal Wind ⋮ Note on ``A new bidirectional algorithm for shortest paths ⋮ Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ Transfer Graph Approach for Multimodal Transport Problems ⋮ Core Routing on Dynamic Time-Dependent Road Networks ⋮ Bundling all shortest paths ⋮ Engineering Route Planning Algorithms ⋮ Energy-optimal routes for battery electric vehicles ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Car or Public Transport—Two Worlds ⋮ Probabilistic model based path planning ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles ⋮ Regarding Goal Bounding and Jump Point Search