On the global minimum in a balanced circular packing problem
From MaRDI portal
Publication:315515
DOI10.1007/S11590-015-0937-9zbMATH Open1353.90133OpenAlexW2141467097MaRDI QIDQ315515FDOQ315515
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
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
- An implementation of Shor's \(r\)-algorithm
- Nondifferentiable optimization and polynomial problems
- Modeling and optimization in space engineering.
- Algorithms of nondifferentiable optimization: development and application
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Linearization method for inverse convex programming
- On the global minimum of the objective function in a balanced circular packing problem
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
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
- Proportional packing of circles in a circular container
- Optimized packing multidimensional hyperspheres: a unified approach
- 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
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
- A local search-based method for sphere packing problems
- 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
Uses Software
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)
