Copertina

The En Route Truck-Drone Delivery Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Krizanc, Danny, Narayanan, Lata, Opatrny, Jaroslav, Pankratov, Denis
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Online Drone Coverage of Targets on a Line
di: Dobrev, Stefan, et al.
Pubblicazione: (2026)

Renting Servers in the Cloud: The Case of Equal Duration Jobs
di: Masoori, Mahtab, et al.
Pubblicazione: (2021)

Renting Servers for Multi-Parameter Jobs in the Cloud
di: Li, Yaqiao, et al.
Pubblicazione: (2024)

Parameterized Algorithms for the Drone Delivery Problem
di: Bartlmae, Simon, et al.
Pubblicazione: (2026)

Last Truck Scheduling for Middle-mile Next-day Delivery Coverage
di: Benidis, Konstantinos, et al.
Pubblicazione: (2023)

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
di: Jana, Saswata, et al.
Pubblicazione: (2026)

Online Drone Scheduling for Last-mile Delivery
di: Jana, Saswata, et al.
Pubblicazione: (2024)

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

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

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

On the Online Weighted Non-Crossing Matching Problem
di: Boyar, Joan, et al.
Pubblicazione: (2026)

A faster heuristic for the Traveling Salesman Problem with Drone
di: Hokama, Pedro H. D. B., et al.
Pubblicazione: (2024)

New Approximation Guarantees for The Inventory Staggering Problem
di: Alon, Noga, et al.
Pubblicazione: (2025)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
di: Mahapatra, Sugyani, et al.
Pubblicazione: (2021)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

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

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Temporal Routing in Static Networks: The Schedule Completion Problem
di: Döring, Michelle, et al.
Pubblicazione: (2026)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
di: Segev, Danny
Pubblicazione: (2024)

Approximation Algorithms for Fair Repetitive Scheduling
di: Hermelin, Danny, et al.
Pubblicazione: (2025)

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

Approximation Schemes for Sequential Hiring Problems
di: Segev, Danny, et al.
Pubblicazione: (2026)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
di: Schild, Aaron, et al.
Pubblicazione: (2025)

Routing-Controlled Spanners
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
di: Aamand, Anders, et al.
Pubblicazione: (2024)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
di: Scheinerman, Danny
Pubblicazione: (2024)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
di: Chandran, L. Sunil, et al.
Pubblicazione: (2024)

In the Search of Optimal Tree Networks: Hardness and Heuristics
di: Buzdalov, Maxim, et al.
Pubblicazione: (2024)

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

Optimal Electrical Oblivious Routing on Expanders
di: Florescu, Cella, et al.
Pubblicazione: (2024)

List Update with Delays or Time Windows
di: Azar, Yossi, et al.
Pubblicazione: (2023)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
di: Hermelin, Danny, et al.
Pubblicazione: (2025)

Clustering with Locally Bounded Ignorance
di: Garvardt, Jaroslav, et al.
Pubblicazione: (2026)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
di: Bhaskar, Umang, et al.
Pubblicazione: (2025)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
di: Narayanan, Shyam, et al.
Pubblicazione: (2024)

Deterministically approximating the volume of a Kostka polytope
di: Narayanan, Hariharan, et al.
Pubblicazione: (2025)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
di: Ma, Hongyao, et al.
Pubblicazione: (2025)

Faster All-Pairs Optimal Electric Car Routing
di: Dorfman, Dani, et al.
Pubblicazione: (2025)

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