Packing unit spheres into the smallest sphere using VNS and NLP

DOI10.1016/J.COR.2012.08.019MaRDI QIDQ340267zbMATH OpenOpenAlexWikidataFDO

Authors Abdulaziz Alkandari, Nenad Mladenović, Rym M'Hallah

Publication date 14 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2012.08.019

zbMATH Keywords

variable neighborhood searchnon-linear programmingthree-dimensional packingunit-sphere packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cell movement (chemotaxis, etc.) (92C17)

Recommendations

• Packing unit spheres into a cube using VNS
• Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
• Packing of various radii solid spheres into a parallelepiped.
• A local search-based method for sphere packing problems
• Optimized packing multidimensional hyperspheres: a unified approach

Cited in

(9)

• A local search-based method for sphere packing problems
• Packing unit spheres into a cube using VNS
• An efficient solution space exploring and descent method for packing equal spheres in a sphere
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
• The method of artificial space dilation in problems of optimal packing of geometric objects
• Simulation of 3D volume filling with non-spherical and spherical titanium alloy powder particles for additive manufacturing
• Exact Semidefinite Programming Bounds for Packing Problems
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• Spreading points using gradient and tabu

This page was built for publication: Packing unit spheres into the smallest sphere using VNS and NLP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340267)