Packing equal circles in a square: A deterministic global optimization approach

DOI10.1016/S0166-218X(01)00359-6zbMath1019.90033OpenAlexW2061779282MaRDI QIDQ1613419

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00359-6

zbMATH Keywords

global optimization branch and bound circle packing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items

Packing equal circles in a square: A deterministic global optimization approach ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Differential evolution methods based on local searches ⋮ New and improved results for packing identical unitary radius circles within triangles, rectangles and strips ⋮ 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 ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ Review of obnoxious facilities location problems ⋮ Greedy vacancy search algorithm for packing equal circles in a square ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ Spreading points using gradient and tabu ⋮ The repeated p-dispersion problem ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Statistical inference for disordered sphere packings ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ Global optimization problems and domain reduction strategies ⋮ Valid constraints for the Point Packing in a Square problem ⋮ Efficiently packing unequal disks in a circle ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors ⋮ Minimizing the object dimensions in circle and sphere packing problems ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ On the problem of packing spheres in a cube ⋮ Unnamed Item ⋮ A reliable area reduction technique for solving circle packing problems ⋮ The exact solution of multiparametric quadratically constrained quadratic programming problems ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ Clustering methods for large scale geometrical global optimization ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ On existence of integral point sets and their diameter bounds ⋮ Linear models for the approximate solution of the problem of packing equal circles into a given domain ⋮ Approximate solutions of continuous dispersion problems

Cites Work