Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
From MaRDI portal
DOI10.1145/79147.214078zbMATH Open0699.68074OpenAlexW2089338760MaRDI QIDQ3477968FDOQ3477968
Authors: Raphael Rom, Ariel Orda 
Publication date: 1990
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/79147.214078
Recommendations
functionalcomplexityshortest pathsgraph algorithmswaiting timesnetwork algorithmstime dependencycomputations on discrete structurescircuit problemspath and
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (only showing first 100 items - show all)
- Algorithms – ESA 2005
- Determining time-dependent minimum cost paths under several objectives
- Dynamic shortest paths minimizing travel times and costs
- Modeling for shortest path of road network with restriction
- On continuous network flows
- Computation of the optimal value function in time-dependent networks
- The time-dependent vehicle routing problem with time windows and road-network information
- Shortest paths in a network with time-dependent flow speeds
- Scheduling algorithms for procrastinators
- Spatio-temporal networks. Modeling and algorithms
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- Shortest paths in piecewise continuous time-dependent networks
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
- Engineering Route Planning Algorithms
- On computing Pareto optimal paths in weighted time-dependent networks
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Distributed shortest-path protocols for time-dependent networks
- Continuous-time shortest path problems with stopping and starting costs
- 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
- Routing of a hazmat truck in the presence of weather systems
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Minimum weight paths in time-dependent networks
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Distance oracles for time-dependent networks
- Least possible time paths in stochastic, time-varying networks.
- An Appraisal of Some Shortest-Path Algorithms
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- On the complexity of time-dependent shortest paths
- Time-dependent SHARC-routing
- Computation of shortest path in cellular automata
- Optimal path selection for minimizing the differential delay in Ethernet-over-SONET
- Flows over time in time-varying networks: optimality conditions and strong duality
- Theory and Applications of Models of Computation
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- On the complexity of time-dependent shortest paths
- Minimum cost paths over dynamic networks
- Data-driven approaches for emissions-minimized paths in urban areas
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks
- Time-dependent shortest path problems with penalties and limits on waiting
- Decremental algorithm for adaptive routing incorporating traveler information
- A directed hypergraph model for random time dependent shortest paths
- Locomotive assignment and freight train scheduling using genetic algorithms
- Dynamic shortest path problems with time-varying costs
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
- Time-dependent routing problems: a review
- Vehicle dispatching with time-dependent travel times
- The approach‐dependent, time‐dependent, label‐constrained shortest path problem
- Point-to-point shortest paths on dynamic time-dependent road networks
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- The time-dependent shortest path and vehicle routing problem
- Time depending shortest-path problems with applications to railway networks
- Core routing on dynamic time-dependent road networks
- Time-Dependent SHARC-Routing
- Shortest paths in time-dependent FIFO networks
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- Minimum time paths in a network with mixed time constraints.
- Algorithms for time-dependent bicriteria shortest path problems
- The constrained reliable shortest path problem in stochastic time-dependent networks
- Time analysis for planning a path in a time-window network
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Two almost easy problems
- Bidirectional \(A^*\) search on time-dependent road networks
- Shortest paths on dynamic graphs
- Multicriteria adaptive paths in stochastic, time-varying networks
- Location of central nodes in time varying computer networks
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Improved approximation for time-dependent shortest paths
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- Minimization of travel time and weighted number of stops in a traffic-light network
- Solving the time varying postman problems with timed automata
- The piecewise constant/linear solution for dynamic user equilibrium
- An axiomatic approach to time-dependent shortest path oracles
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- Engineering time-dependent many-to-many shortest paths computation
- Title not available (Why is that?)
- Locations on time-varying networks
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
- Intelligent transportation systems -- Enabling technologies
- Efficient computation of shortest paths in time-dependent multi-modal networks
- A concise guide to existing and emerging vehicle routing problem variants
- The fastest itinerary in time-dependent decentralized travel information systems
- Temporal cliques admit sparse spanners
- The time-dependent rural postman problem: polyhedral results
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
- Path Problems in Complex Networks
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Title not available (Why is that?)
- Minimum‐cost flow problems having arc‐activation costs
- Shortest path with acceleration constraints: complexity and approximation algorithms
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Efficient computation of time-dependent centralities in air transportation networks
- Title not available (Why is that?)
- Formal language constrained path problems
- How to find good night train connections
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)
