Packing equal circles into a circle with circular prohibited areas
From MaRDI portal
Publication:4903496
DOI10.1080/00207160.2012.685468zbMATH Open1255.52014OpenAlexW2050024620MaRDI QIDQ4903496FDOQ4903496
Authors:
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.685468
Recommendations
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- 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
- scientific article; zbMATH DE number 2169484
- Proportional packing of circles in a circular container
- Solving the problem of packing equal and unequal circles in a circular container
Cites Work
- Disk packing for the estimation of the size of a wire bundle
- Packing congruent hyperspheres into a hypersphere
- On Numerical Issues of Interior Point Methods
- Minimizing the object dimensions in circle and sphere packing problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Formulation Space Search for Circle Packing Problems
- A heuristic for the circle packing problem with a variety of containers
- Solving the problem of packing equal and unequal circles in a circular container
- Integrated container loading software for pulp and paper industry
- Packing Cylinders into Cylindrical Containers
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Title not available (Why is that?)
- A note on finite abelian covers
- Über einen geometrischen Satz
Cited In (16)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Title not available (Why is that?)
- A nonlinear programming model with implicit variables for packing ellipsoids
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Proportional packing of circles in a circular container
- 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
- Optimized packing multidimensional hyperspheres: a unified approach
- Optimized packing clusters of objects in a rectangular container
- Packing circles within ellipses
- Packing Convex 3D Objects with Special Geometric and Balancing Conditions
- Packing ellipsoids by nonlinear optimization
- Recursive circle packing problems
- A local search-based method for sphere packing problems
- Packing up to 50 equal circles in a square
- Optimal packings for filled rings of circles.
- Decomposition Algorithm for Irregular Placement Problems
This page was built for publication: Packing equal circles into a circle with circular prohibited areas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903496)
