Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid

Asia-Pacific Journal of Operational Research

Volumn 28, Issue 6, 2011, Pages 739-753

  Kubach, Timo ^a   Bortfeldt, Andreas ^a   Tilli, Thomas ^a   Gehring, Hermann ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

greedy method; knapsack problem; Packing; spheres; strip packing problem

Indexed keywords

DIFFERENT SIZES; FINITE SET; FIXED WIDTH; GREEDY ALGORITHMS; GREEDY METHOD; KNAPSACK PROBLEMS; STRIP PACKING PROBLEM; VARIABLE LENGTH;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; PACKING; SPHERES; THREE DIMENSIONAL;

PROBLEM SOLVING;

EID: 84855686535     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595911003326     Document Type: Article

References (12)

1. George, JA, JM George and BW Lamer (1995). Packing different-sized circles into a rectangular container. European Journal of Operational Research, 84, 693-712.
2. Glover, F and G Kochenberger (eds) (2003). Handbook on Metaheuristics. Boston, MA: Kluwer Academic Publishers.
3. Hifi, M and R M'Hallah (2004). Approximate algorithms for constrained circular cutting problems. Computers and Operations Research, 31, 675-694. (Pubitemid 38135872)
4. Hifi, M, VT Paschos and VA Zissimopoulos (2004). Simulated annealing approach for the circular cutting problem. European Journal of Operational Research, 159, 430-448.
5. Huang, WQ, Y Li, H Akeb and CM Li (2005). Greedy algorithms for packing unequal circles into a rectangular container. Journal of the Operational Research Society, 56, 539-548. (Pubitemid 40567540)
6. Kubach, T, A Bortfeldt, T Tilli and H Gehring (2009). Parallel Greedy Algorithms for Packing Unequal Spheres into a Cuboidal Strip or a Cuboid (Working Paper), Diskussionsbeitrag der Fakultät für Wirtschaftswissenschaft der FernUniversität in Hagen, Nr. 440, Hagen. Available at http://www.fernuni-hagen.de/WINF.
7. Lenstra, JK and AHG Rinnooy Kan (1979). Complexity of packing, covering, and partitioning problems. In Schrijver A (ed.), Packing and Covering in Combinatorics. Amsterdam: Mathematisch Centrum, pp. 275-291.
8. Stoyan, YY, G Yaskow and G Scheithauer (2003). Packing of various radii solid spheres into a parallelepiped. Central European Journal of Operational Research, 11, 389-407.
9. Stoyan, YY and G Yaskov (2004). A mathematical model and a solution method for the problem of placing various-sized circles into a strip. European Journal of Operational Research, 156, 590-600.
10. Sutou, A and Y Dai (2002). Global optimization approach to unequal sphere packing problems in 3D. Journal of Optimization Theory and Applications, 114, 671-694.
11. Visscher, W and M Bolsterli (1972). Random packing of equal and unequal spheres in two and three dimensions. Nature, 239, 504-507.
12. Wang, J (1999). Packing of unequal spheres and automated radiosurgical treatment planning. Journal of Combinatorial Optimization, 3, 453-463. (Pubitemid 129575327)