Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns

DOI10.1007/978-3-030-26458-1_25zbMath1436.90118arXiv2002.04906OpenAlexW2999272056MaRDI QIDQ3296267

Damien Chablat, Yann Briheche, Frédéric Barbaresco, Fouad Bennis

Publication date: 7 July 2020

Published in: Nature-Inspired Methods for Metaheuristics Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.04906

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• CPLEX

Cites Work

• Theoretical complexity of grid cover problems used in radar applications
• The set covering problem revisited: an empirical study of the value of dual information
• Integer Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns