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

DOI10.1134/S0965542513110080zbMath1313.65139MaRDI QIDQ2940410

Sh. I. Galiev, Maria S. Lisafina

Publication date: 26 January 2015

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

Full work available at URL: http://www.maik.ru/cgi-perl/search.pl?type=abstract&name=commat&number=11&year=13&page=1748

zbMATH Keywords

linear modelsrectangular domainlinear programming problemnumerical methods of packing of equal ellipses

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (7)

Packing ellipsoids by nonlinear optimization ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Packing ovals in optimized regular polygons ⋮ A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids ⋮ Numerical optimization method for packing regular convex polygons ⋮ Optimized ellipse packings in regular polygons ⋮ Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set

Cites Work

• Unnamed Item
• A literature review on circle and sphere packing problems: models and methodologies
• New approaches to circle packing in a square. With program codes.
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Packing of ellipses with continuously distributed area
• Packing equal circles in a square: A deterministic global optimization approach
• Location analysis: a synthesis and survey
• Two-dimensional packing problems: a survey
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses

This page was built for publication: Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain