On the global minimum in a balanced circular packing problem

DOI10.1007/S11590-015-0937-9MaRDI QIDQ315515zbMATH OpenOpenAlexFDO

Authors P. I. Stetsyuk, T. Romanova, Guntram Scheithauer

Publication date 21 September 2016

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-015-0937-9

zbMATH Keywords

nonsmooth optimizationcirclesbalanced packingdual boundShor's \(r\)-algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Recommendations

• On the global minimum of the objective function in a balanced circular packing problem
• Global optimization method for finding dense packings of equal circles in a circle
• Packing equal circles in a square: A deterministic global optimization approach
• scientific article; zbMATH DE number 2185524
• A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas

Cites work

• Algorithms of nondifferentiable optimization: development and application
• An implementation of Shor's \(r\)-algorithm
• Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
• Linearization method for inverse convex programming
• Modeling and optimization in space engineering.
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Nondifferentiable optimization and polynomial problems
• On the global minimum of the objective function in a balanced circular packing problem

Cited in

(18)

• On the global minimum of the objective function in a balanced circular packing problem
• Packing circles into perimeter-minimizing convex hulls
• Packing problems in space solved by CPLEX: an experimental analysis
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
• Optimized packing multidimensional hyperspheres: a unified approach
• Proportional packing of circles in a circular container
• Optimized packing clusters of objects in a rectangular container
• Decomposition algorithm for irregular placement problems
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• Iterated dynamic thresholding search for packing equal circles into a circular container
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Parallel computing technologies for solving optimization problems of geometric design
• Solving circle packing problems by global optimization: numerical results and industrial applications
• A local search-based method for sphere packing problems
• On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
• Packing convex 3D objects with special geometric and balancing conditions
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
• The method of artificial space dilation in problems of optimal packing of geometric objects

Describes a project that uses

Uses Software

• SolvOpt

This page was built for publication: On the global minimum in a balanced circular packing problem

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