A branch-and-bound algorithm applied to optimal radar search pattern

DOI10.1016/J.AST.2006.12.007MaRDI QIDQ3445938zbMATH OpenOpenAlexFDO

Authors Pierre Dodin, Pierre Minvielle, Jean-Pierre Le Cadre

Publication date 8 June 2007

Published in Aerospace Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ast.2006.12.007

zbMATH Keywords

beam schedulingoptimizationradar search patternsearch theory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Application models in control theory (93C95)

Recommendations

• Branch and bound methods for a search problem
• scientific article; zbMATH DE number 1203241
• scientific article; zbMATH DE number 4131939
• Optimal Search Density for a Stationary Target Among Stationary False Targets
• scientific article; zbMATH DE number 1750452

Cited in

(5)

• Novel cued search strategy based on information gain for phased array radar
• scientific article; zbMATH DE number 4154202 (Why is no real title available?)
• scientific article; zbMATH DE number 1203241 (Why is no real title available?)
• Branch and bound methods for a search problem
• Technical Note—An Application of Witzgall’s Algorithm to a Problem in Radar Signal Design

This page was built for publication: A branch-and-bound algorithm applied to optimal radar search pattern

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