Global Optimization in Geometry — Circle Packing into the Square

DOI10.1007/0-387-25570-2_9MaRDI QIDQ5421806zbMATH OpenOpenAlexFDO

Authors Péter Gábor Szabó, Mihály Csaba Markót, Tibor Csendes

Publication date 24 October 2007

Published in Essays and Surveys in Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-25570-2_9

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Nonconvex programming, global optimization (90C26)

Cited in

(22)

• Minimum perimeter rectangles that enclose congruent non-overlapping circles
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
• On convex relaxations for quadratically constrained quadratic programming
• On tackling reverse convex constraints for non-overlapping of unequal circles
• On the problem of packing spheres in a cube
• QPLIB: a library of quadratic programming instances
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
• Extremal problems for convex polygons
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Differential evolution methods based on local searches
• Quasi-physical global optimization method for solving the equal circle packing problem
• A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
• Global optimization method for finding dense packings of equal circles in a circle
• A literature review on circle and sphere packing problems: models and methodologies
• A heuristic approach for packing identical rectangles in convex regions
• The circle packing problem: a theoretical comparison of various convexification techniques
• Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
• Efficiently packing unequal disks in a circle
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Solving the problem of packing equal and unequal circles in a circular container

This page was built for publication: Global Optimization in Geometry — Circle Packing into the Square

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