An Efficient Algorithm for the Fast Delivery Problem
暂无分享,去创建一个
Thomas Erlebach | Iago A. Carvalho | Kleitos Papadopoulos | T. Erlebach | I. Carvalho | Kleitos Papadopoulos
[1] Andreas Bärtschi,et al. Energy-Efficient Fast Delivery by Mobile Agents , 2017, FCT.
[2] Michael T. Goodrich,et al. Geometric Data Structures , 2000, Handbook of Computational Geometry.
[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[4] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[5] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[6] Paolo Penna,et al. Data Delivery by Energy-Constrained Mobile Agents , 2013, ALGOSENSORS.
[7] Dorothea Wagner,et al. Time-Dependent Route Planning , 2009, Encyclopedia of GIS.
[8] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[9] Jérémie Chalopin,et al. Collaborative Delivery with Energy-Constrained Mobile Robots , 2016, SIROCCO.
[10] Chase C. Murray,et al. The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery , 2015 .
[11] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[12] Alan T. Murray,et al. A Deviation Flow Refueling Location Model for Continuous Space: A Commercial Drone Delivery System for Urban Areas , 2017 .
[13] Dane Bamburry,et al. Drones: Designed for Product Delivery , 2015, Design Management Review.
[14] Mark de Berg,et al. Computational Geometry: Algorithms and Applications, Second Edition , 2000 .
[15] Jérémie Chalopin,et al. Data Delivery by Energy-Constrained Mobile Agents on a Line , 2014, ICALP.
[16] Shuji Kijima,et al. Searching with Increasing Speeds , 2018, SSS.
[17] Matús Mihalák,et al. Collective Fast Delivery by Energy-Efficient Agents , 2018, MFCS.
[18] Paolo Penna,et al. Energy-efficient Delivery by Heterogeneous Mobile Agents , 2016, STACS.