an:07218044
Zbl 1436.90118
Briheche, Yann; Barbaresco, Frederic; Bennis, Fouad; Chablat, Damien
Branch-and-bound method for just-in-time optimization of radar search patterns
EN
Bennis, Fouad (ed.) et al., Nature-inspired methods for metaheuristics optimization. Algorithms and applications in science and engineering. Cham: Springer. Model. Optim. Sci. Technol. 16, 465-488 (2020).
2020
a
90C27 90C57 90C59 90C90
Summary: Set covering is a well-known problem in combinatorial optimization. The objective is to cover a set of elements, called the universe, using a minimum number of available covers. The theoretical problem is known to be generally NP-difficult to solve [\textit{V. V. Vazirani}, Approximation algorithms. Berlin: Springer (2001)], and is often encountered in industrial processes and real-life problem. In particular, the mathematical formulation of the set cover problem is well-suited for radar search pattern optimization of modern radar systems.
For the entire collection see [Zbl 1432.90007].