A local search-based method for sphere packing problems
From MaRDI portal
Publication:1634289
DOI10.1016/j.ejor.2018.10.016zbMath1404.90140OpenAlexW2898734264WikidataQ129015538 ScholiaQ129015538MaRDI QIDQ1634289
Publication date: 18 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
Cites Work
- On the global minimum in a balanced circular packing problem
- Packing unequal spheres into various containers
- Packing unit spheres into the smallest sphere using VNS and NLP
- Stability and convergence analysis of a dynamics-based collective method for random sphere packing
- A literature review on circle and sphere packing problems: models and methodologies
- Beam search and non-linear programming tools for the circular packing problem
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Packing different-sized circles into a rectangular container
- Packing of various radii solid spheres into a parallelepiped.
- Approximate algorithms for constrained circular cutting 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
- Packing of unequal spheres and automated radiosurgical treatment planning
- Minimizing the object dimensions in circle and sphere packing problems
- An improved typology of cutting and packing problems
- Packing Unit Spheres into a Cube Using VNS
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- Packing equal circles into a circle with circular prohibited areas
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Greedy algorithms for packing unequal circles into a rectangular container
This page was built for publication: A local search-based method for sphere packing problems
