On the global minimum in a balanced circular packing problem

DOI10.1007/s11590-015-0937-9zbMath1353.90133OpenAlexW2141467097MaRDI QIDQ315515

Tatiana E. Romanova, Petro I. Stetsyuk, 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)

Related Items (15)

A local search-based method for sphere packing problems ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Proportional packing of circles in a circular container ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Packing Convex 3D Objects with Special Geometric and Balancing Conditions ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ The method of artificial space dilation in problems of optimal packing of geometric objects ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Optimized packing clusters of objects in a rectangular container ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization

Uses Software

• SolvOpt

Cites Work

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

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