Optimal coverage of borders using unmanned aerial vehicles

DOI10.22049/CCO.2023.27951.1403MaRDI QIDQ7017510zbMATH OpenFDO

Authors Mohammad Etezadi, Siamak Ashrafi, Mostafa Ghasemi

Publication date 6 March 2025

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2023.27951.1403

zbMATH Keywords

facility location problemtree networkUAV routingunmanned aerial vehicle

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Integer programming (90C10) Applications of mathematical programming (90C90)

Cites work

• A comparative study of heuristics for a two-level routing-location problem
• A large scale location-allocation problem in the natural rubber industry
• A multi-objective green UAV routing problem
• A two-phase tabu search approach to the location routing problem
• Combined location-routing problems: A synthesis and future research directions
• The Transportation-Location Problem
• Unmanned aerial vehicle hub-location and routing for monitoring geographic borders

This page was built for publication: Optimal coverage of borders using unmanned aerial vehicles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017510)