Ellipsoid targeting with overlap

DOI10.1007/978-3-319-51500-7_7MaRDI QIDQ4595404zbMATH OpenOpenAlexFDO

Authors Nicholas J. Daras

Publication date 30 November 2017

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-51500-7_7

zbMATH Keywords

sphere packingoverlap measureellipsoid packingdistribution of targetsellipsoid targeting with overlapfunction of damage

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Semidefinite programming (90C22)

Recommendations

• Distribution of number of point targets killed and higher moments of coverage of area targets
• ‘No Overlap No Gap’ and the attack of a linear target by n different weapons
• Packing ellipsoids with overlap
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• Optimal Attack Against An Area Defense Protecting Many Targets

Cited in

(1)

• Distribution of number of point targets killed and higher moments of coverage of area targets

This page was built for publication: Ellipsoid targeting with overlap

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