Pages that link to "Item:Q3971577"
From MaRDI portal
The following pages link to Minimum weight paths in time-dependent networks (Q3971577):
Displaying 39 items.
- Minimum cost paths over dynamic networks (Q325482) (← links)
- Dynamic shortest path problems with time-varying costs (Q845562) (← links)
- Minisum amd minimax paths of a moving facility on a network (Q1186001) (← links)
- Continuous-time shortest path problems with stopping and starting costs (Q1195684) (← links)
- Least possible time paths in stochastic, time-varying networks. (Q1406727) (← 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)
- A finite-time algorithm for shortest path problems with time-varying costs (Q1802425) (← links)
- On continuous network flows (Q1892659) (← links)
- Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362) (← links)
- Flows over time in time-varying networks: optimality conditions and strong duality (Q2253989) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← 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)
- Ranking paths in stochastic time-dependent networks (Q2514742) (← 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)
- Time dependent multiobjective best path for multimodal urban routing (Q2883602) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- (Q3044346) (← links)
- How to find good night train connections (Q3076014) (← links)
- Optimal path finding in direction, location, and time dependent environments (Q3120563) (← links)
- Minimum work paths in elevated networks (Q3528153) (← links)
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (Q4408702) (← links)
- Dynamic shortest paths minimizing travel times and costs (Q4419276) (← links)
- Efficient modeling of travel in networks with time-varying link speeds (Q4519129) (← links)
- Optimal path finding with space‐ and time‐variant metric weights via multi‐layer CNN (Q4539905) (← links)
- (Q4577932) (← links)
- Distributed shortest-path protocols for time-dependent networks (Q5137327) (← links)
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)
- Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- Nondecreasing paths in a weighted graph or: how to optimally read a train schedule (Q6486953) (← links)
