Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-022-00403-w / rank
Normal rank
 
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
Property / Wikidata QID
 
Property / Wikidata QID: Q114227013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution Algorithms for the Bounded Acceleration Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal complexity algorithm for minimum-time velocity planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution of the minimum-time speed planning problem based on lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with forbidden paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reoptimization algorithm for the shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time‐dependent shortest paths with discounted waits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2865872 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-022-00403-W / rank
 
Normal rank

Latest revision as of 00:11, 17 December 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
    0 references
    0 references
    0 references
    0 references
    4 October 2022
    0 references
    shortest path
    0 references
    speed planning
    0 references
    complexity
    0 references
    approximation algorithms
    0 references

    Identifiers