Packing unit spheres into the smallest sphere using VNS and NLP

DOI10.1016/j.cor.2012.08.019zbMath1349.90718OpenAlexW2042323836WikidataQ114858916 ScholiaQ114858916MaRDI QIDQ340267

Nenad Mladenović, A. Alkandari, 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)

Related Items

A local search-based method for sphere packing problems ⋮ A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows ⋮ Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches ⋮ Spreading points using gradient and tabu ⋮ The method of artificial space dilation in problems of optimal packing of geometric objects ⋮ Exact Semidefinite Programming Bounds for Packing Problems