Pages that link to "Item:Q497898"
From MaRDI portal
The following pages link to Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898):
Displaying 3 items.
- Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks (Q506709) (← links)
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
- A novel index method for \(K\) nearest object query over time-dependent road networks (Q2325155) (← links)
