New approaches to circle packing in a square. With program codes.
From MaRDI portal
Publication:855072
zbMath1128.52012MaRDI QIDQ855072
Tibor Csendes, E. Specht, Péter Gábor Szabó, Mihály Csaba Markót, Inmaculada F. García, Leocadio G. Casado
Publication date: 27 December 2006
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Circle packings and discrete conformal geometry (52C26)
Related Items (51)
Interval unions ⋮ Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Covering part of a planar network ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ Differential evolution methods based on local searches ⋮ On Malfatti's marble problem ⋮ High density packings of equal circles in rectangles with variable aspect ratio ⋮ Evolutionary computation solutions to the circle packing problem ⋮ Packing ovals in optimized regular polygons ⋮ On optimal piercing of a square ⋮ Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Packings of equal disks in a square torus ⋮ Review of obnoxious facilities location problems ⋮ Greedy vacancy search algorithm for packing equal circles in a square ⋮ Rigorous packing of unit squares into a circle ⋮ Online circle and sphere packing ⋮ Geometric Packing under Nonuniform Constraints ⋮ Packing disks into disks with optimal worst-case density ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ The repeated p-dispersion problem ⋮ Efficient algorithms for the dense packing of congruent circles inside a square ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ Model development and solver demonstrations using randomized test problems ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ A heuristic for the circle packing problem with a variety of containers ⋮ Valid constraints for the Point Packing in a Square problem ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ The GLOBAL optimization method revisited ⋮ Exact algorithms for the solution of the grey pattern quadratic assignment problem ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study ⋮ On limits of dense packing of equal spheres in a cube ⋮ Cooperative cover of uniform demand ⋮ 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 ⋮ Unnamed Item ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Clustering methods for large scale geometrical global optimization ⋮ A bounded space algorithm for online circle packing ⋮ On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container ⋮ Improved interval methods for solving circle packing problems in the unit square ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ Packing Unit Spheres into a Cube Using VNS ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ Optimized ellipse packings in regular polygons ⋮ Linear models for the approximate solution of the problem of packing equal circles into a given domain
Uses Software
This page was built for publication: New approaches to circle packing in a square. With program codes.
