Packing Unit Spheres into a Cube Using VNS

DOI10.1016/j.endm.2012.10.027zbMath1268.90152OpenAlexW2015314711MaRDI QIDQ2840774

Rym M'Hallah, A. Alkandari

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.027

zbMATH Keywords

nonlinear programmingvariable neighborhood searchthree-dimensional packingpacking spheres in a cube

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A local search-based method for sphere packing problems ⋮ Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches

Uses Software

• NLPQLP

Cites Work

• Unnamed Item
• Beam search and non-linear programming tools for the circular packing problem
• New approaches to circle packing in a square. With program codes.
• Variable neighbourhood search: methods and applications
• Variable neighborhood search
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Dense packings of equal spheres in a cube
• New formulations for the Kissing Number Problem
• Minimizing the object dimensions in circle and sphere packing problems
• Variable neighborhood search and local branching
• An improved typology of cutting and packing problems
• The Kissing Number Problem: A New Result from Global Optimization
• Variable neighborhood search: Principles and applications

This page was built for publication: Packing Unit Spheres into a Cube Using VNS