Minimum weight paths in time-dependent networks
From MaRDI portal
Publication:3971577
Recommendations
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Minimum cost paths over dynamic networks
- Time dependency in multiple objective dynamic programming
- Dynamic shortest paths minimizing travel times and costs
Cited in
(39)- On continuous network flows
- Dynamic shortest paths minimizing travel times and costs
- Computation of the optimal value function in time-dependent networks
- Energy-optimal routes for battery electric vehicles
- Shortest paths in piecewise continuous time-dependent networks
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- On computing Pareto optimal paths in weighted time-dependent networks
- Continuous-time shortest path problems with stopping and starting costs
- Distributed shortest-path protocols for time-dependent networks
- Least possible time paths in stochastic, time-varying networks.
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- scientific article; zbMATH DE number 2086247 (Why is no real title available?)
- Efficient modeling of travel in networks with time-varying link speeds
- Flows over time in time-varying networks: optimality conditions and strong duality
- Time dependent multiobjective best path for multimodal urban routing
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
- The fastest itinerary in time-dependent decentralized travel information systems
- Minimum cost paths over dynamic networks
- Minimum work paths in elevated networks
- A finite-time algorithm for shortest path problems with time-varying costs
- A directed hypergraph model for random time dependent shortest paths
- Dynamic shortest path problems with time-varying costs
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Path Problems in Complex Networks
- Shortest paths in time-dependent FIFO networks
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Algorithms for time-dependent bicriteria shortest path problems
- Optimal path finding with space‐ and time‐variant metric weights via multi‐layer CNN
- Ranking paths in stochastic time-dependent networks
- Optimal path finding in direction, location, and time dependent environments
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- How to find good night train connections
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
This page was built for publication: Minimum weight paths in time-dependent networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971577)
