Global Optimization in Geometry — Circle Packing into the Square

DOI10.1007/0-387-25570-2_9zbMath1136.90445OpenAlexW182221926MaRDI QIDQ5421806

Mihály Csaba Markót, Péter Gábor Szabó, 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

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

Related Items (19)

Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Differential evolution methods based on local searches ⋮ An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Efficiently packing unequal disks in a circle ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Extremal problems for convex polygons ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ On the problem of packing spheres in a cube ⋮ QPLIB: a library of quadratic programming instances ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container ⋮ Minimum perimeter rectangles that enclose congruent non-overlapping circles ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure

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