Pages that link to "Item:Q3477968"
From MaRDI portal
The following pages link to Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (Q3477968):
Displaying 50 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Minimum cost paths over dynamic networks (Q325482) (← links)
- Decremental algorithm for adaptive routing incorporating traveler information (Q339637) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Data-driven approaches for emissions-minimized paths in urban areas (Q342252) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Location of central nodes in time varying computer networks (Q811350) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← 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 destination-preserving model for simulating Wardrop equilibria in traffic flow on networks (Q887718) (← links)
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
- Continuous-time shortest path problems with stopping and starting costs (Q1195684) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- Time depending shortest-path problems with applications to railway networks (Q1388936) (← links)
- A directed hypergraph model for random time dependent shortest paths (Q1569934) (← links)
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach (Q1651545) (← links)
- Determining time-dependent minimum cost paths under several objectives (Q1722968) (← links)
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
- Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks (Q1869688) (← links)
- On continuous network flows (Q1892659) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Computation of shortest path in cellular automata (Q1914940) (← 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)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
- Flows over time in time-varying networks: optimality conditions and strong duality (Q2253989) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules (Q2572903) (← 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)
- Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
