Valid constraints for the Point Packing in a Square problem

DOI10.1016/J.DAM.2013.06.008MaRDI QIDQ2446880zbMATH OpenOpenAlexFDO

Authors Alberto 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

nonconvex NLPpoint packing in a squaresymmetry

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Packing-constrained point coverings
• Packing a Square Lattice with a Rectangle-Free Set of Points
• scientific article; zbMATH DE number 3955884
• Packing under convex quadratic constraints
• Packing under convex quadratic constraints
• An interval method to validate optimal solutions of the ``packing circles in a unit square problems
• Optimal packings of unit squares in a square
• On a Square Packing Problem
• Efficient packing of unit squares in a square

Cites work

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

Cited in

(3)

• On existence of integral point sets and their diameter bounds
• Packing-constrained point coverings
• On the characteristic and diameter of planar integral point sets

Describes a project that uses

Uses Software

• CPLEX
• BARON

This page was built for publication: Valid constraints for the Point Packing in a Square problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446880)