On the fast delivery problem with one or two packages
Authors:
- Iago A. CarvalhoICIago A. Carvalho
- Thomas ErlebachTEThomas Erlebach
- Kleitos PapadopoulosKPKleitos Papadopoulos
- 1 February 2021
- journal article
- conference paper
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 115, 246-263
Abstract
No abstract availableKeywords
Funding Information
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
This publication has 9 references indexed in Scilit:
- Collaborative delivery with energy-constrained mobile robotsTheoretical Computer Science, 2020
- The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel deliveryTransportation Research Part C: Emerging Technologies, 2015
- Drones: Designed for Product DeliveryDesign Management Review, 2015
- Parameterized Complexity1999
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problemDiscrete Applied Mathematics, 1994
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966