Pages that link to "Item:Q2532356"
From MaRDI portal
The following pages link to The shortest route through a network with time-dependent internodal transit times (Q2532356):
Displayed 50 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- A simulated annealing for multi-criteria network path problems (Q339658) (← links)
- Data-driven approaches for emissions-minimized paths in urban areas (Q342252) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- Snapshot centrality indices in dynamic FIFO networks (Q662157) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Dynamic shortest path problems with time-varying costs (Q845562) (← links)
- Routing of a hazmat truck in the presence of weather systems (Q856789) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network (Q948645) (← links)
- Continuous-time shortest path problems with stopping and starting costs (Q1195684) (← links)
- Travelling time on dense networks (Q1232970) (← links)
- The implicit general order complementarity problem, models and iterative methods (Q1308653) (← links)
- Periodicity and critical circuits in a generalized max-algebra setting (Q1332447) (← links)
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
- Determining time-dependent minimum cost paths under several objectives (Q1722968) (← links)
- Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
- Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
- Shortest paths in a network with time-dependent flow speeds (Q1969888) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- On the fast delivery problem with one or two packages (Q2208259) (← links)
- Dynamic journeying under uncertainty (Q2253524) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- Dynamic programming and minimum risk paths (Q2432847) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (Q2514743) (← links)
- Solving the \(k\)-shortest path problem with time windows in a time varying network (Q2517796) (← links)
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation (Q2817091) (← links)
- Bidirectional A* search on time-dependent road networks (Q2892160) (← links)
- How to find good night train connections (Q3076014) (← links)
- Efficient Computation of Time-Dependent Centralities in Air Transportation Networks (Q3078386) (← links)
- Bidirectional A ∗ Search for Time-Dependent Fast Paths (Q3506419) (← links)
- Time-Dependent SHARC-Routing (Q3541096) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- Shortest paths on dynamic graphs (Q3638853) (← links)
- Shortest route with time dependent length of edges and limited delay possibilities in nodes (Q4143045) (← links)
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set (Q4809666) (← links)
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (Q5085472) (← links)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009) (← links)
- The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)
- The impact of time aggregation and travel time models on time-dependent routing solutions (Q6063581) (← links)
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)
- A fishing route optimization decision support system: the case of the tuna purse seiner (Q6090176) (← links)