Dynamic shortest path problems with time-varying costs
From MaRDI portal
Publication:845562
DOI10.1007/S11590-009-0162-5zbMATH Open1181.90047OpenAlexW1996702143MaRDI QIDQ845562FDOQ845562
Authors: S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi 
Publication date: 29 January 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0162-5
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- An Appraisal of Some Shortest-Path Algorithms
- The shortest route through a network with time-dependent internodal transit times
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Minimum weight paths in time-dependent networks
- Negative-cycle detection algorithms
- Title not available (Why is that?)
- Dynamic flows in time-varying networks.
- Time-varying shortest path problems with constraints
- Continuous-Time Shortest Path Problems and Linear Programming
- A finite-time algorithm for shortest path problems with time-varying costs
- Dynamic shortest paths minimizing travel times and costs
- Continuous-time shortest path problems with stopping and starting costs
Cited In (18)
- Dynamic shortest paths minimizing travel times and costs
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- Adaptive image interpolation by cardinal splines in piecewise constant tension
- Continuous-time dynamic shortest path problems with negative transit times
- Continuous-time shortest path problems with stopping and starting costs
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- A minmax regret version of the time-dependent shortest path problem
- Algorithms – ESA 2004
- Efficient modeling of travel in networks with time-varying link speeds
- The time-varying shortest path problem with fuzzy transit costs and speedup
- Dynamic minimum cost path problem with curfews
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- Minimum cost paths over dynamic networks
- A finite-time algorithm for shortest path problems with time-varying costs
- On solving continuous-time dynamic network flows
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- An approach to the shortest path problem with time-varying
- Shortest paths on dynamic graphs
This page was built for publication: Dynamic shortest path problems with time-varying costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845562)
