Pages that link to "Item:Q2491770"
From MaRDI portal
The following pages link to Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770):
Displayed 9 items.
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks (Q833580) (← links)
- Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-logit formulas (Q1002057) (← links)
- An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- Flows over time in time-varying networks: optimality conditions and strong duality (Q2253989) (← links)
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
- Common Route Planning for Carpoolers – Model and Exact Algorithm (Q2950466) (← links)
- Bicriterion Shortest Paths in Stochastic Time-Dependent Networks (Q3649590) (← links)