GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID

DOI10.1142/S0217595911003326zbMath1235.90127OpenAlexW2037148555MaRDI QIDQ3114612

Andreas Bortfeldt, Thomas Tilli, T. Kubach, Hermann Gehring

Publication date: 19 February 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595911003326

zbMATH Keywords

spherespackingknapsack problemstrip packing problemgreedy method

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A local search-based method for sphere packing problems ⋮ Packing unequal spheres into various containers ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Packing different-sized circles into a rectangular container
• Approximate algorithms for constrained circular cutting problems
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• A simulated annealing approach for the circular cutting problem
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• Packing of unequal spheres and automated radiosurgical treatment planning
• Greedy algorithms for packing unequal circles into a rectangular container
• Handbook of metaheuristics

This page was built for publication: GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID