The following pages link to (Q4792778):
Displaying 7 items.
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks (Q940859) (← links)
- Route planning with turn restrictions: A computational experiment (Q1758274) (← links)
- Optimal placement of wireless charging lanes in road networks (Q1983692) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
- Combining discrete and continuous optimization to solve kinodynamic motion planning problems (Q2358063) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs (Q6113877) (← links)