Pages that link to "Item:Q4540052"
From MaRDI portal
The following pages link to The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (Q4540052):
Displaying 8 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Data-driven approaches for emissions-minimized paths in urban areas (Q342252) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
- OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS (Q5151077) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- Vulnerability of scheduled networks and a generalization of Menger's theorem (Q5689807) (← links)
