GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
From MaRDI portal
Publication:3114612
DOI10.1142/S0217595911003326zbMath1235.90127MaRDI 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)
90C27: Combinatorial optimization
Related Items
Packing unequal spheres into various containers, A local search-based method for sphere packing problems, 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