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

Authors:
Marco Locatelli;Ulrich Raber
Affiliations:
Departimento di Informatica, Universitá di Torino, Corso Svizzera, 185, I-10149 Torino, Italy;FB IV, Mathematik, Universität Trier, 54286 Trier, Germany
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 2
Cited 19

New results in the packing of equal circles in a square

Discrete Mathematics
A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs

Journal of Global Optimization

Sensor deployment and target localization in distributed sensor networks

ACM Transactions on Embedded Computing Systems (TECS)
Optimal Movement-Assisted Sensor Deployment and Its Extensions in WirelessSensor Networks

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A reliable area reduction technique for solving circle packing problems

Computing
Maximin Latin Hypercube Designs in Two Dimensions

Operations Research
Minimizing the object dimensions in circle and sphere packing problems

Computers and Operations Research
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

Optimization Methods & Software - GLOBAL OPTIMIZATION
New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

Computers and Operations Research
Solving the problem of packing equal and unequal circles in a circular container

Journal of Global Optimization
Virtual force-directed particle swarm optimization for dynamic deployment in wireless sensor networks

ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Orthogonal packing of identical rectangles within isotropic convex regions

Computers and Industrial Engineering
Artificial potential field approach in WSN deployment: Cost, QoM, connectivity, and lifetime constraints

Computer Networks: The International Journal of Computer and Telecommunications Networking
A heuristic approach for packing identical rectangles in convex regions

Computers and Operations Research
Review: A survey on coverage and connectivity issues in wireless sensor networks

Journal of Network and Computer Applications
Greedy vacancy search algorithm for packing equal circles in a square

Operations Research Letters
Efficiently packing unequal disks in a circle

Operations Research Letters
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square

Discrete Applied Mathematics
Patterns and pathways of packing circles into a square

International Journal of Computer Applications in Technology
Valid constraints for the Point Packing in a Square problem

Discrete Applied Mathematics
Differential evolution methods based on local searches

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper the problem of packing n equal circles into the unit square will be considered. Starting from a general rectangular branch-and-bound algorithm, many tools, which exploit the special structure of the problem and properties fulfilled by some of its solutions, will be introduced and discussed. Computational results will be presented and, in particular, the optimality within a given tolerance of best known solutions in the literature for n= 10-35, n = 38, 39 will be proved, with the exception of the case n= 32 for which a new solution has been detected and proved to be optimal within the given tolerance. Moreover, a new solution for n = 37 has been detected, but not yet proved to be optimal within the given tolerance.