Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-022-00403-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4292571915 / rank | |||
Normal rank | |||
Revision as of 21:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path with acceleration constraints: complexity and approximation algorithms |
scientific article |
Statements
Shortest path with acceleration constraints: complexity and approximation algorithms (English)
0 references
4 October 2022
0 references
shortest path
0 references
speed planning
0 references
complexity
0 references
approximation algorithms
0 references
