The following pages link to (Q5365046):
Displaying 5 items.
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- Engineering time-dependent many-to-many shortest paths computation (Q2917289) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
- A time-dependent subgraph-capacity model for multiple shortest paths and application to \(\text{CO}_2\)/contrail-safe aircraft trajectories (Q6620756) (← links)
