A literature review on circle and sphere packing problems: models and methodologies
From MaRDI portal
(Redirected from Publication:606170)
Recommendations
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- On a Problem Related to Sphere and Circle Packing
- scientific article; zbMATH DE number 3849991
- Minimizing the object dimensions in circle and sphere packing problems
- scientific article; zbMATH DE number 432979
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A local search-based method for sphere packing problems
- A Multi-sphere Scheme for 2D and 3D Packing Problems
- Algorithms for congruent sphere packing and applications
- Formulation Space Search for Circle Packing Problems
Cites work
- scientific article; zbMATH DE number 1748533 (Why is no real title available?)
- scientific article; zbMATH DE number 2209735 (Why is no real title available?)
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- A beam search algorithm for the circular packing problem
- A dynamic adaptive local search algorithm for the circular packing problem
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A new upper bound for the cylinder packing problem
- A reliable area reduction technique for solving circle packing problems
- A short note on a simple search heuristic for the diskspacking problem
- A simulated annealing approach for the circular cutting problem
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Algorithms for the circular two-dimensional open dimension problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- An improved typology of cutting and packing problems
- Annealing, Cylinder Packing By Simulated
- Approximate algorithms for constrained circular cutting problems
- Beam search and non-linear programming tools for the circular packing problem
- Covering a compact polygonal set by identical circles
- DC programming: overview.
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Dense packings of equal spheres in a cube
- Disk packing for the estimation of the size of a wire bundle
- Disk packing in a square: a new global optimization approach
- Dissimilarity measures for population-based global optimization algorithms
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Efficiently packing unequal disks in a circle
- Extremal problems for convex polygons
- Generating optimal T-shape cutting patterns for circular blanks
- Global Optimization in Geometry — Circle Packing into the Square
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Greedy algorithms for packing unequal circles into a rectangular container
- Improving dense packings of equal disks in a square
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Maximin Latin Hypercube Designs in Two Dimensions
- Minimizing the object dimensions in circle and sphere packing problems
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- New approaches to circle packing in a square. With program codes.
- New heuristics for packing unequal circles into a circular container
- New results in the packing of equal circles in a square
- Nonlinear optimization with GAMS /LGO
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- PERM for solving circle packing problem
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Packing different-sized circles into a rectangular container
- Packing equal circles in a square: A deterministic global optimization approach
- Packing identical spheres into a cylinder
- Packing of unequal spheres and automated radiosurgical treatment planning
- Packing of various radii solid spheres into a parallelepiped.
- Packing up to 50 equal circles in a square
- Reformulation descent applied to circle packing problems
- Repeated patterns of dense packings of equal disks in a square
- Rigorous global search: continuous problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Some new structures for the ``equal circles packing in a square problem
Cited in
(59)- Approximation schemes for covering and packing problems in image processing and VLSI
- Configuration space of geometric objects
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- Integer programming formulations for approximate packing circles in a rectangular container
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- QPLIB: a library of quadratic programming instances
- scientific article; zbMATH DE number 7559235 (Why is no real title available?)
- Split packing: algorithms for packing circles with optimal worst-case density
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- A general system for heuristic minimization of convex functions over non-convex sets
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- Optimized object packings using quasi-phi-functions
- Optimized ellipse packings in regular polygons
- Optimized packing multidimensional hyperspheres: a unified approach
- Packing congruent hyperspheres into a hypersphere
- Efficient algorithms for the dense packing of congruent circles inside a square
- Optimal packing of material flow on conveyor belts
- Minimal surface convex hulls of spheres
- Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
- An optimal classification method for biological and medical data
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- Modeling close packing of 3D objects
- Dense packing of congruent circles in free-form non-convex containers
- On the problem of packing spheres in a cube
- A memetic algorithm to pack unequal circles into a square
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Polynomial-time approximation schemes for circle and other packing problems
- Recursive circle packing problems
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Packing unequal spheres into various containers
- High density packings of equal circles in rectangles with variable aspect ratio
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- A heuristic for the circle packing problem with a variety of containers
- Digital model of natural cores using geometric design
- Packing spheres with quasi-containment conditions
- Approximate packing: integer programming models, valid inequalities and nesting
- Packing disks into disks with optimal worst-case density
- A local search-based method for sphere packing problems
- Efficient approximations for the online dispersion problem
- Packing ovals in optimized regular polygons
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Packing congruent spheres into a multi‐connected polyhedral domain
- A support tool for planning classrooms considering social distancing between students
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Spreading points using gradient and tabu
- Model development and solver demonstrations using randomized test problems
- Packing circular-like objects in a rectangular container
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Techniques and results on approximation algorithms for packing circles
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- A bounded space algorithm for online circle packing
- Minimizing the object dimensions in circle and sphere packing problems
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Online circle and sphere packing
- Damped Arrow-Hurwicz algorithm for sphere packing
- Packing non-identical circles within a rectangle with open length
This page was built for publication: A literature review on circle and sphere packing problems: models and methodologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606170)
