A local search-based method for sphere packing problems
type: Item
instance of: scholarly article
title: A local search-based method for sphere packing problems
zbMATH Open document ID: 1404.90140
author: Mhand Hifi
author: Labib Yousef
published in: European Journal of Operational Research
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6994578
zbMATH Keywords: heuristics
zbMATH Keywords: cuboid container
zbMATH Keywords: optimization
zbMATH Keywords: sphere packing
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.10.016
OpenAlex ID: W2898734264
cites work: Minimizing the object dimensions in circle and sphere packing problems
cites work: Packing different-sized circles into a rectangular container
cites work: Approximate algorithms for constrained circular cutting problems
cites work: Beam search and non-linear programming tools for the circular packing problem
cites work: A literature review on circle and sphere packing problems: models and methodologies
cites work: A reactive local search-based algorithm for the disjunctively constrained knapsack problem
cites work: Greedy algorithms for packing unequal circles into a rectangular container
cites work: GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
cites work: Stability and convergence analysis of a dynamics-based collective method for random sphere packing
cites work: Packing unit spheres into a cube using VNS
cites work: Packing unit spheres into the smallest sphere using VNS and NLP
cites work: On the global minimum in a balanced circular packing problem
cites work: Packing equal circles into a circle with circular prohibited areas
cites work: Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
cites work: Packing of various radii solid spheres into a parallelepiped.
cites work: Packing cylinders and rectangular parallelepipeds with distances between them into a given region
cites work: Packing unequal spheres into various containers
cites work: Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
cites work: An improved algorithm for the packing of unequal circles within a larger containing circle
cites work: Packing of unequal spheres and automated radiosurgical treatment planning
cites work: An improved typology of cutting and packing problems
Wikidata QID: Q129015538
DOI: 10.1016/J.EJOR.2018.10.016
description: scientific article; zbMATH DE number 6994578