Cover Image

Online Vehicle Routing with Pickups and Deliveries under Time-Dependent Travel-Time Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kontogiannis, Spyros, Paraskevopoulos, Andreas, Zaroliagis, Christos
Format:	Preprint
Published:	2024
Subjects:	Computational Engineering, Finance, and Science Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
by: Karathanasis, Konstantinos, et al.
Published: (2025)

A Linear Time Quantum Algorithm for Pairwise Sequence Alignment
by: Khan, Md. Rabiul Islam, et al.
Published: (2023)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
by: Gibbons, Ethan, et al.
Published: (2026)

Planning For Edge Failure in Fixed-Charge Flow Networks
by: Olson, Daniel, et al.
Published: (2024)

Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
by: Kong, Yong
Published: (2014)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
by: Blauth, Jannis, et al.
Published: (2022)

ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in Human Trajectories
by: Zhang, Bowen, et al.
Published: (2024)

Controlling the Spread of Epidemics on Networks with Differential Privacy
by: Nguyen, Dung, et al.
Published: (2025)

Rapid GPU-Based Pangenome Graph Layout
by: Li, Jiajie, et al.
Published: (2024)

Fast multiplication of random dense matrices with fixed sparse matrices
by: Liang, Tianyu, et al.
Published: (2023)

Continuous Map Matching to Paths under Travel Time Constraints
by: Bosch, Yannick, et al.
Published: (2025)

Online Dispatching and Routing for Automated Guided Vehicles in Pickup and Delivery Systems on Loop-Based Graphs
by: Stubbe, Louis, et al.
Published: (2023)

Sensitivity-Aware Density Estimation in Multiple Dimensions
by: Boquet-Pujadas, Aleix, et al.
Published: (2025)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
by: Erlebach, Thomas, et al.
Published: (2026)

Exact Exploration
by: Blass, Andreas, et al.
Published: (2024)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

GPU-Native Compressed Neighbor Lists with a Space-Filling-Curve Data Layout
by: Thaler, Felix, et al.
Published: (2026)

Pandora's Box Problem With Time Constraints
by: Amanatidis, Georgios, et al.
Published: (2024)

Estimating Hitting Times Locally At Scale
by: Haris, Themistoklis, et al.
Published: (2025)

Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025)

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
by: Herman, Dylan, et al.
Published: (2026)

An Algorithm for Optimal Partitioning of Data on an Interval
by: Jackson, Brad, et al.
Published: (2003)

Canadian Traveller Problems in Temporal Graphs
by: Bellitto, Thomas, et al.
Published: (2024)

Polynomial time algorithm for optimal stopping with fixed accuracy
by: Goldberg, David A., et al.
Published: (2018)

Online Computation with Untrusted Advice
by: Angelopoulos, Spyros, et al.
Published: (2019)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

The En Route Truck-Drone Delivery Problem
by: Krizanc, Danny, et al.
Published: (2024)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2026)

Competitive Search in the Line and the Star with Predictions
by: Angelopoulos, Spyros
Published: (2023)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2025)

Prophet and Secretary at the Same Time
by: Kehne, Gregory, et al.
Published: (2025)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
by: Boreale, Michele, et al.
Published: (2019)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
by: Held, Stephan, et al.
Published: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
by: Zhao, Jingyang, et al.
Published: (2023)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
by: O'Hara, Patrick, et al.
Published: (2024)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
by: Barto, Libor, et al.
Published: (2024)

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
by: Uroić, Leon Stjepan, et al.
Published: (2026)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
by: Zhao, Jingyang, et al.
Published: (2022)