Pages that link to "Item:Q3637315"
From MaRDI portal
The following pages link to Engineering Route Planning Algorithms (Q3637315):
Displaying 24 items.
- Multiple-path selection for new highway alignments using discrete algorithms (Q320693) (← links)
- A lower bound for the quickest path problem (Q337093) (← links)
- Decremental algorithm for adaptive routing incorporating traveler information (Q339637) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- Shells structure in uncorrelated scale-free networks (Q2164093) (← links)
- Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Unconstrained and curvature-constrained shortest-path distances and their approximation (Q2421590) (← links)
- Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194) (← links)
- Candidate Sets for Alternative Routes in Road Networks (Q2828197) (← links)
- User-Constrained Multimodal Route Planning (Q2828200) (← links)
- Bidirectional A* search on time-dependent road networks (Q2892160) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU (Q5066588) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
- Efficient Large-Scale Multi-Drone Delivery using Transit Networks (Q5856479) (← links)
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication (Q6108693) (← links)
- Categorification of Negative Information using Enrichment (Q6150139) (← links)
