Valid constraints for the Point Packing in a Square problem

DOI10.1016/j.dam.2013.06.008zbMath1293.90056OpenAlexW2114189882MaRDI QIDQ2446880

Alberto L. C. Costa

Publication date: 23 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.008

zbMATH Keywords

symmetrynonconvex NLPpoint packing in a square

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

On existence of integral point sets and their diameter bounds

Uses Software

• BARON
• CPLEX

Cites Work

• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• New approaches to circle packing in a square. With program codes.
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Packing different-sized circles into a rectangular container
• Integrated container loading software for pulp and paper industry
• Approximate algorithms for constrained circular cutting problems
• Packing equal circles in a square: A deterministic global optimization approach
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• A simulated annealing approach for the circular cutting problem
• Generating optimal T-shape cutting patterns for circular blanks
• Symmetry in Mathematical Programming
• Branching and bounds tighteningtechniques for non-convex MINLP