Proportional packing of circles in a circular container
From MaRDI portal
Publication:6160555
Recommendations
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Packing circular-like objects in a rectangular container
- A heuristic for the circle packing problem with a variety of containers
- Packing equal circles into a circle with circular prohibited areas
- Packing different-sized circles into a rectangular container
Cites work
- r-algorithms and ellipsoids
- A polyhedral branch-and-cut approach to global optimization
- Algorithms of nondifferentiable optimization: development and application
- Combinatorial configurations in balance layout optimization problems
- Decomposition algorithm for irregular placement problems
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- On the global minimum in a balanced circular packing problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Packing circular-like objects in a rectangular container
- Packing equal circles into a circle with circular prohibited areas
- Shor's r-algorithms: theory and practice
- The complexity of cutting complexes
Cited in
(11)- Packing different-sized circles into a rectangular container
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Recursive circle packing problems
- Packing equal circles into a circle with circular prohibited areas
- Packing circular-like objects in a rectangular container
- Mixed-integer DC programming based algorithms for the circular packing problem
- Digital model of natural cores using geometric design
- Simulation of 3D volume filling with non-spherical and spherical titanium alloy powder particles for additive manufacturing
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Packing spheres with quasi-containment conditions
- Optimal packing of Minkowski unit spheres on a plane
This page was built for publication: Proportional packing of circles in a circular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160555)
