A literature review on circle and sphere packing problems: models and methodologies
From MaRDI portal
Publication:606170
DOI10.1155/2009/150624zbMATH Open1198.90337OpenAlexW1979411905WikidataQ58647077 ScholiaQ58647077MaRDI QIDQ606170FDOQ606170
Authors: Mhand Hifi, Rym M'Hallah 
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
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
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Rigorous global search: continuous problems
- DC programming: overview.
- An improved typology of cutting and packing problems
- Disk packing for the estimation of the size of a wire bundle
- New approaches to circle packing in a square. With program codes.
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Approximate algorithms for constrained circular cutting problems
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Minimizing the object dimensions in circle and sphere packing problems
- Greedy algorithms for packing unequal circles into a rectangular container
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing different-sized circles into a rectangular container
- Reformulation descent applied to circle packing problems
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- PERM for solving circle packing problem
- Extremal problems for convex polygons
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- A dynamic adaptive local search algorithm for the circular packing problem
- Disk packing in a square: a new global optimization approach
- Algorithms for the circular two-dimensional open dimension problem
- Global Optimization in Geometry — Circle Packing into the Square
- Efficiently packing unequal disks in a circle
- A beam search algorithm for the circular packing problem
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Packing of various radii solid spheres into a parallelepiped.
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- A simulated annealing approach for the circular cutting problem
- Dense packings of equal spheres in a cube
- Packing identical spheres into a cylinder
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Title not available (Why is that?)
- Annealing, Cylinder Packing By Simulated
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Title not available (Why is that?)
- Dissimilarity measures for population-based global optimization algorithms
- A short note on a simple search heuristic for the diskspacking problem
- Nonlinear optimization with GAMS /LGO
- Maximin Latin Hypercube Designs in Two Dimensions
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- New results in the packing of equal circles in a square
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Packing up to 50 equal circles in a square
- Repeated patterns of dense packings of equal disks in a square
- Beam search and non-linear programming tools for the circular packing problem
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Some new structures for the ``equal circles packing in a square problem
- Generating optimal T-shape cutting patterns for circular blanks
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
- Packing of unequal spheres and automated radiosurgical treatment planning
- A reliable area reduction technique for solving circle packing problems
- A new upper bound for the cylinder packing problem
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Covering a compact polygonal set by identical circles
Cited In (59)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
- Digital model of natural cores using geometric design
- Packing spheres with quasi-containment conditions
- Spreading points using gradient and tabu
- 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
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Integer programming formulations for approximate packing circles in a rectangular container
- QPLIB: a library of quadratic programming instances
- Title not available (Why is that?)
- Split packing: algorithms for packing circles with optimal worst-case density
- A general system for heuristic minimization of convex functions over non-convex sets
- Efficient Approximations for the Online Dispersion Problem
- 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
- Efficient algorithms for the dense packing of congruent circles inside a square
- Packing congruent hyperspheres into a hypersphere
- Optimal packing of material flow on conveyor belts
- Minimal surface convex hulls of spheres
- An optimal classification method for biological and medical data
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- Dense packing of congruent circles in free-form non-convex containers
- Modeling close packing of 3D objects
- On the problem of packing spheres in a cube
- A memetic algorithm to pack unequal circles into a square
- Recursive circle packing problems
- 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
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- Packing unequal spheres into various containers
- High density packings of equal circles in rectangles with variable aspect ratio
- A heuristic for the circle packing problem with a variety of containers
- 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
- 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
- Model development and solver demonstrations using randomized test problems
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Packing circular-like objects in a rectangular container
- 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
- Online circle and sphere packing
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Packing non-identical circles within a rectangle with open length
- Damped Arrow-Hurwicz algorithm for sphere packing
Uses Software
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)
