A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

DOI10.1137/S1052623403425617zbMath1089.90045OpenAlexW2023493235MaRDI QIDQ5317555

Mihály Csaba Markót, Tibor Csendes

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623403425617

zbMATH Keywords

circle packinginterval arithmeticbranch-and-bound methodoptimality proof

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Interval and finite arithmetic (65G30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)

Related Items (28)

Minimal surface convex hulls of spheres ⋮ Differential evolution methods based on local searches ⋮ Interval methods for verifying structural optimality of circle packing configurations in the unit square ⋮ Quasi-physical global optimization method for solving the equal circle packing problem ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ Greedy vacancy search algorithm for packing equal circles in a square ⋮ Rigorous packing of unit squares into a circle ⋮ OPTIMIZATION AND THE MIRANDA APPROACH IN DETECTING HORSESHOE-TYPE CHAOS BY COMPUTER ⋮ (Global) optimization: historical notes and recent developments ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ Efficiently packing unequal disks in a circle ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Bound constrained interval global optimization in the COCONUT environment ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ The GLOBAL optimization method revisited ⋮ Cutting ellipses from area-minimizing rectangles ⋮ On limits of dense packing of equal spheres in a cube ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ A reliable area reduction technique for solving circle packing problems ⋮ A verified optimization technique to locate chaotic regions of Hénon systems ⋮ Clustering methods for large scale geometrical global optimization ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Improved interval methods for solving circle packing problems in the unit square ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Global Attractivity of the Zero Solution for Wright's Equation

This page was built for publication: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems