Shortest path with acceleration constraints: complexity and approximation algorithms
Crossref DOI link: https://doi.org/10.1007/s10589-022-00403-w
Published Online: 2022-08-10
Published Print: 2022-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ardizzoni, S.
Consolini, L.
Laurini, M.
Locatelli, M. http://orcid.org/0000-0001-7138-8653
Funding for this research was provided by:
Università degli Studi di Parma
Text and Data Mining valid from 2022-08-10
Version of Record valid from 2022-08-10
Article History
Received: 4 February 2022
Accepted: 22 July 2022
First Online: 10 August 2022