A literature review on circle and sphere packing problems: models and methodologies
From MaRDI portal
Publication:606170
DOI10.1155/2009/150624zbMath1198.90337OpenAlexW1979411905WikidataQ58647077 ScholiaQ58647077MaRDI QIDQ606170
Publication date: 16 November 2010
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/229947
Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Dense packing of congruent circles in free-form non-convex containers, Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium, Minimal surface convex hulls of spheres, A local search-based method for sphere packing problems, \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm, Modeling close packing of 3D objects, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A formulation space search heuristic for packing unequal circles in a fixed size 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, Packing unequal spheres into various containers, A memetic algorithm to pack unequal circles into a square, High density packings of equal circles in rectangles with variable aspect ratio, Packing non-identical circles within a rectangle with open length, Packing ovals in optimized regular polygons, Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, Online circle and sphere packing, Packing disks into disks with optimal worst-case density, Spreading points using gradient and tabu, Approximation schemes for covering and packing problems in image processing and VLSI, Efficient algorithms for the dense packing of congruent circles inside a square, Model development and solver demonstrations using randomized test problems, Digital model of natural cores using geometric design, Packing congruent hyperspheres into a hypersphere, A heuristic for the circle packing problem with a variety of containers, An optimal classification method for biological and medical data, Configuration space of geometric objects, Integer programming formulations for approximate packing circles in a rectangular container, Split packing: algorithms for packing circles with optimal worst-case density, Efficient Approximations for the Online Dispersion Problem, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Optimized Object Packings Using Quasi-Phi-Functions, Optimized packing multidimensional hyperspheres: a unified approach, A general system for heuristic minimization of convex functions over non-convex sets, Packing circular-like objects in a rectangular container, Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences, Damped Arrow-Hurwicz algorithm for sphere packing, Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study, Packing congruent spheres into a multi‐connected polyhedral domain, On the problem of packing spheres in a cube, Maximizing the sum of radii of balls inscribed in a polyhedral set, Unnamed Item, Optimal packing of material flow on conveyor belts, QPLIB: a library of quadratic programming instances, A bounded space algorithm for online circle packing, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Recursive circle packing problems, On tackling reverse convex constraints for non-overlapping of unequal circles, Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition), A support tool for planning classrooms considering social distancing between students, Repulsion-based p-dispersion with distance constraints in non-convex polygons, Techniques and results on approximation algorithms for packing circles, Packing a fixed number of identical circles in a circular container with circular prohibited areas, Optimized ellipse packings in regular polygons
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A short note on a simple search heuristic for the diskspacking problem
- Beam search and non-linear programming tools for the circular packing problem
- New approaches to circle packing in a square. With program codes.
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Efficiently packing unequal disks in a circle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A beam search algorithm for the circular packing problem
- Covering a compact polygonal set by identical circles
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- Packing different-sized circles into a rectangular container
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Rigorous global search: continuous problems
- Packing up to 50 equal circles in a square
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Packing of various radii solid spheres into a parallelepiped.
- Approximate algorithms for constrained circular cutting problems
- Some new structures for the ``equal circles packing in a square problem
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- Disk packing for the estimation of the size of a wire bundle
- Reformulation descent applied to circle packing problems
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A simulated annealing approach for the circular cutting problem
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Dense packings of equal spheres in a cube
- Generating optimal T-shape cutting patterns for circular blanks
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- New results in the packing of equal circles in a square
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
- Repeated patterns of dense packings of equal disks in a square
- DC programming: overview.
- Packing of unequal spheres and automated radiosurgical treatment planning
- Dissimilarity measures for population-based global optimization algorithms
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- PERM for solving circle packing problem
- Nonlinear optimization with GAMS /LGO
- Extremal problems for convex polygons
- Minimizing the object dimensions in circle and sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- A reliable area reduction technique for solving circle packing problems
- An improved typology of cutting and packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- A New Upper Bound for the Cylinder Packing Problem
- Disk Packing in a Square: A New Global Optimization Approach
- Packing identical spheres into a cylinder
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Maximin Latin Hypercube Designs in Two Dimensions
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Algorithms for the circular two‐dimensional open dimension problem
- Cylinder packing by simulated annealing
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Greedy algorithms for packing unequal circles into a rectangular container
