Shortest path with acceleration constraints: complexity and approximation algorithms
From MaRDI portal
Publication:2082550
DOI10.1007/s10589-022-00403-wzbMath1502.90179OpenAlexW4292571915WikidataQ114227013 ScholiaQ114227013MaRDI QIDQ2082550
M. Laurini, S. Ardizzoni, Luca Consolini, Marco Locatelli
Publication date: 4 October 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00403-w
Cites Work
- Unnamed Item
- Unnamed Item
- The shortest path problem with forbidden paths
- The \(k\)-centrum shortest path problem
- A reoptimization algorithm for the shortest path problem with time windows
- A solution of the minimum-time speed planning problem based on lattice theory
- An optimal complexity algorithm for minimum-time velocity planning
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- A dual algorithm for the constrained shortest path problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
- Time‐dependent shortest paths with discounted waits
- An Appraisal of Some Shortest-Path Algorithms
- Bottleneck extrema
- Solution Algorithms for the Bounded Acceleration Shortest Path Problem
This page was built for publication: Shortest path with acceleration constraints: complexity and approximation algorithms