Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses

zbMath0853.65060MaRDI QIDQ1921619

Sh. I. Galiev

Publication date: 27 October 1996

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

optimization algorithmscovering of plane domainsprescribed number of ellipses

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain

This page was built for publication: Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses