Minimizing the object dimensions in circle and sphere packing problems

DOI10.1016/J.COR.2006.11.002zbMath1177.90332OpenAlexW2102777196MaRDI QIDQ2468491

Ernesto G. Birgin, F. N. C. Sobral

Publication date: 23 January 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.11.002

zbMATH Keywords

algorithmsmodelsnon-linear programmingpacking of circles and spheres

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (30)

Dense packing of congruent circles in free-form non-convex containers ⋮ A local search-based method for sphere packing problems ⋮ Packing ellipsoids by nonlinear optimization ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Packing unequal spheres into various containers ⋮ New and improved results for packing identical unitary radius circles within triangles, rectangles and strips ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ On the use of third-order models with fourth-order regularization for unconstrained optimization ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ Packing congruent hyperspheres into a hypersphere ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ A heuristic for the circle packing problem with a variety of containers ⋮ A new semidefinite programming relaxation scheme for a class of quadratic matrix problems ⋮ Adaptive beam search lookahead algorithms for the circular packing problem ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Packing equal circles into a circle with circular prohibited areas ⋮ A beam search algorithm for the circular packing problem ⋮ Packing congruent spheres into a multi‐connected polyhedral domain ⋮ Packing circles within ellipses ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ Recursive circle packing problems ⋮ A support tool for planning classrooms considering social distancing between students ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ Packing Unit Spheres into a Cube Using VNS ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• SPG
• GAMS
• MINOS
• ALGENCAN
• VMD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing up to 50 equal circles in a square
• Packing equal circles in a square: A deterministic global optimization approach
• Reformulation descent applied to circle packing problems
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• New results in the packing of equal circles in a square
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• An improved typology of cutting and packing problems
• Method of sentinels for packing items within arbitrary convex regions
• Computational Structure of the N-Body Problem
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Algorithm 813
• The Packing of Equal Circles in a Square
• A fast algorithm for particle simulations

This page was built for publication: Minimizing the object dimensions in circle and sphere packing problems