The Smart Coverage Path Planner for Autonomous Drones Using TSP and Tree Selection
The problem of efficiently covering an area with a limited number of sensors or cameras is
an important research topic in various fields such as surveillance, monitoring, and …
an important research topic in various fields such as surveillance, monitoring, and …
Improved guarantees for the a priori TSP
J Blauth, M Neuwohner… - Mathematics of …, 2024 - pubsonline.informs.org
We revisit the a priori TSP (with independent activation) and prove stronger approximation
guarantees than were previously known. In the a priori TSP, we are given a metric space (V …
guarantees than were previously known. In the a priori TSP, we are given a metric space (V …
A large and natural Class of - and -complete Problems in Bilevel and Robust Optimization
C Grüne, L Wulf - arXiv preprint arXiv:2311.10540, 2023 - arxiv.org
Because $\Sigma^ p_2 $-and $\Sigma^ p_3 $-hardness proofs are usually tedious and
difficult, not so many complete problems for these classes are known. This is especially true …
difficult, not so many complete problems for these classes are known. This is especially true …
Memetic Strategies for Network Design Problems
M Amirghasemi, TT Duong, N Hutchison… - Frontiers in Nature …, 2022 - Springer
In this chapter, memetic strategies are analyzed for the Steiner tree problem in graphs as a
classic network design problem. Steiner tree problems can model a wide range of real-life …
classic network design problem. Steiner tree problems can model a wide range of real-life …