Cover Image

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ardizzoni, Stefano, Consolini, Luca, Laurini, Mattia, Locatelli, Marco
Format:	Preprint
Published:	2021
Subjects:	Data Structures and Algorithms Systems and Control 90-08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Implicit Decision Diagrams
by: Rudich, Isaac, et al.
Published: (2026)

A Dynamic Programming Approach for Road Traffic Estimation
by: Laurini, Mattia, et al.
Published: (2024)

Hidden convexity property of a speed planning problem
by: Ardizzoni, Stefano, et al.
Published: (2025)

Speed planning by minimizing travel time and energy consumption
by: Ardizzoni, Stefano, et al.
Published: (2025)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
by: Diaby, Moustapha, et al.
Published: (2023)

An online joint replenishment problem combined with single machine scheduling
by: Györgyi, Péter, et al.
Published: (2022)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)

Identification of Cyclists' Route Choice Criteria
by: Ardizzoni, Stefano, et al.
Published: (2024)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)

Breaking the Bellman-Ford Shortest-Path Bound
by: Elmasry, Amr
Published: (2024)

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
by: Vakhania, Nodari, et al.
Published: (2024)

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2022)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
by: Baxi, Saumil, et al.
Published: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
by: Bentert, Matthias, et al.
Published: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
by: Chitnis, Rajesh, et al.
Published: (2024)

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

The Discrepancy of Shortest Paths
by: Bodwin, Greg, et al.
Published: (2024)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
by: Ozturk, Berk, et al.
Published: (2025)

Coach Reservation for Groups Requests
by: Cardonha, Carlos H., et al.
Published: (2024)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
by: Atalig, Sunny, et al.
Published: (2024)

On Constrained and k Shortest Paths
by: Bendahi, Abderrahim, et al.
Published: (2024)

Shortest Paths in Multimode Graphs
by: Kirkpatrick, Yael, et al.
Published: (2025)

All-Hops Shortest Paths
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Disjunctive Sum of Squares
by: Ahmadi, Amir Ali, et al.
Published: (2026)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
by: Marica, Edina, et al.
Published: (2026)

Adaptive control of dynamic networks
by: Pan, Chunyu, et al.
Published: (2023)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)

The Steiner Shortest Path Tree Problem
by: Asher, Omer, et al.
Published: (2025)

Verifying Shortest Paths in Linear Time
by: Shokry, Ahmed, et al.
Published: (2024)

Hierarchical Multicriteria Shortest Path Search
by: Kurbanov, Temirlan, et al.
Published: (2025)

Covering Approximate Shortest Paths with DAGs
by: Assadi, Sepehr, et al.
Published: (2025)

Shortcutting for Negative-Weight Shortest Path
by: Li, George Z., et al.
Published: (2025)

On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives
by: Consolini, Luca, et al.
Published: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
by: Assadi, Sepehr, et al.
Published: (2025)

Fully Dynamic Shortest Paths in Sparse Digraphs
by: Karczmarz, Adam, et al.
Published: (2024)

Hardness of Approximation for Shortest Path with Vector Costs
by: Carlson, Charlie, et al.
Published: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
by: Funayama, Ryo, et al.
Published: (2024)

On Incremental Approximate Shortest Paths in Directed Graphs
by: Górkiewicz, Adam, et al.
Published: (2025)