Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
From MaRDI portal
(Redirected from Publication:3477968)
Recommendations
Cited in
(only showing first 100 items - show all)- Continuous-time shortest path problems with stopping and starting costs
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Time depending shortest-path problems with applications to railway networks
- Minimum time paths in a network with mixed time constraints.
- Least possible time paths in stochastic, time-varying networks.
- A directed hypergraph model for random time dependent shortest paths
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
- Reachability for airline networks: fast algorithm for shortest path problem with time windows
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Determining time-dependent minimum cost paths under several objectives
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Vehicle dispatching with time-dependent travel times
- Minimization of travel time and weighted number of stops in a traffic-light network
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- On continuous network flows
- Intelligent transportation systems -- Enabling technologies
- Computation of shortest path in cellular automata
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Shortest paths in a network with time-dependent flow speeds
- Temporal cliques admit sparse spanners
- Shortest path with acceleration constraints: complexity and approximation algorithms
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
- An axiomatic approach to time-dependent shortest path oracles
- A concise guide to existing and emerging vehicle routing problem variants
- The time-dependent vehicle routing problem with time windows and road-network information
- Flows over time in time-varying networks: optimality conditions and strong duality
- Optimum departure times for commuters in congested networks
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- The fastest itinerary in time-dependent decentralized travel information systems
- Shortest paths in time-dependent FIFO networks
- Algorithms for time-dependent bicriteria shortest path problems
- Multicriteria adaptive paths in stochastic, time-varying networks
- Shortest paths in piecewise continuous time-dependent networks
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- On computing Pareto optimal paths in weighted time-dependent networks
- Computation of the optimal value function in time-dependent networks
- Core routing on dynamic time-dependent road networks
- Efficient computation of shortest paths in time-dependent multi-modal networks
- The time-dependent rural postman problem: polyhedral results
- Bidirectional A^* search on time-dependent road networks
- Spatio-temporal networks. Modeling and algorithms
- Path Problems in Complex Networks
- Engineering time-dependent many-to-many shortest paths computation
- Improved approximation for time-dependent shortest paths
- How to find good night train connections
- Efficient computation of time-dependent centralities in air transportation networks
- Minimum cost paths over dynamic networks
- Decremental algorithm for adaptive routing incorporating traveler information
- Time-dependent routing problems: a review
- Data-driven approaches for emissions-minimized paths in urban areas
- Two almost easy problems
- Solving the time varying postman problems with timed automata
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Modeling for shortest path of road network with restriction
- Time-Dependent SHARC-Routing
- Engineering Route Planning Algorithms
- Shortest paths on dynamic graphs
- scientific article; zbMATH DE number 3978796 (Why is no real title available?)
- Minimum weight paths in time-dependent networks
- Time-varying shortest path problems with constraints
- scientific article; zbMATH DE number 1114039 (Why is no real title available?)
- scientific article; zbMATH DE number 1947387 (Why is no real title available?)
- Dynamic shortest paths minimizing travel times and costs
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Time analysis for planning a path in a time-window network
- On the complexity of time-dependent shortest paths
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Locations on time-varying networks
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- The constrained reliable shortest path problem in stochastic time-dependent networks
- Formal language constrained path problems
- Time-dependent shortest path problems with penalties and limits on waiting
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Temporal cliques admit sparse spanners
- Distributed shortest-path protocols for time-dependent networks
- Commuters' Paths with Penalties for Early or Late Arrival Time
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- On the complexity of time-dependent shortest paths
- Time-dependent SHARC-routing
- Algorithms – ESA 2005
- The approach‐dependent, time‐dependent, label‐constrained shortest path problem
- Locomotive assignment and freight train scheduling using genetic algorithms
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
- An Appraisal of Some Shortest-Path Algorithms
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- The time-dependent shortest path and vehicle routing problem
- Theory and Applications of Models of Computation
- Minimum‐cost flow problems having arc‐activation costs
- Point-to-point shortest paths on dynamic time-dependent road networks
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- The piecewise constant/linear solution for dynamic user equilibrium
- Robust and distributionally robust shortest path problems: a survey
- Labeling methods for partially ordered paths
This page was built for publication: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477968)
