Valid constraints for the Point Packing in a Square problem

Authors:
Alberto Costa
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 7
Cited 0

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

Discrete Applied Mathematics
Approximate algorithms for constrained circular cutting problems

Computers and Operations Research
Generating optimal T-shape cutting patterns for circular blanks

Computers and Operations Research
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

Journal of Global Optimization
Branching and bounds tighteningtechniques for non-convex MINLP

Optimization Methods & Software - GLOBAL OPTIMIZATION
Reformulations in mathematical programming: automatic symmetry detection and exploitation

Mathematical Programming: Series A and B
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of placing n points in the unit square in such a way as to maximize their minimum pairwise distance m. Starting from two properties of the optimal solution presented by Locatelli and Raber in [Discrete Applied Mathematics 122 (1-3) (2002) 139-166], and using the known theoretical lower and upper bounds, we derive some constraints for tightening the original formulation of the problem.