Minimizing the object dimensions in circle and sphere packing problems

Computers and Operations Research

Volumn 35, Issue 7, 2008, Pages 2357-2375

  Birgin, E G ^a   Sobral, F N C ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algorithms; Models; Non linear programming; Packing of circles and spheres

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; NONLINEAR PROGRAMMING; THREE DIMENSIONAL; TWO DIMENSIONAL;

OBJECT DIMENSIONS; SPHERE PACKING; STRIP OBJECTS; TWICE-DIFFERENTIABLE MODELS;

PROBLEM SOLVING;

EID: 36448976929     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.11.002     Document Type: Article

References (38)

1. Maranas C.D., Floudas C.A., and Pardalos P.M. New results in the packing of equal circles in a square. Discrete Mathematics 142 (1995) 287-293
2. Murtagh BA, Saunders MA. MINOS 5.5 user's guide. Report SOL 83-20R, Systems Optimization Laboratory, Stanford University [revised July 1998].
3. Brooke A., Kendrick D., and Meeraus A. GAMS: a user's guide, release 2.25 (1992), The Scientific Press, Redwood City, CA
4. Nurmela K.J., and ÖstergÅrd P.R.J. Packing up to 50 equal circles in a square. Discrete and Computational Geometry 18 (1997) 111-120
5. Goldberg M. The packing of equal circles in a square. Mathematics Magazine 43 (1970) 24-30
6. de Groot C, Peikert R, Würtz D. The optimal packing of ten equal circles in a square. IPS Research Report 90-12, ETH, Zürich; 1990.
7. Locatelli M., and Raber U. Packing equal circles in a square: a deterministic global optimization approach. Discrete Applied Mathematics 122 (2002) 139-166
8. Mladenović N., Plastria F., and Urošević D. Reformulation descent applied to circle packing problems. Computers and Operations Research 32 (2005) 2419-2434
9. Stoyan Yu.G., and Yas'kov G.N. A mathematical model and a solution method for the problem of placing various-sized circles into a strip. European Journal of Operational Research 156 (2004) 590-600
10. Stoyan Yu.G., and Yas'kov G.N. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions in Operational Research 5 (1998) 45-57
11. Stoyan, Yu G, Yas'kov, GN, Scheithauer G. Packing spheres of various radii into a parallelepiped, Preprint MATH-NM-15-2001, TU Dresden; 2001.
12. Birgin E.G., Martínez J.M., and Ronconi D.P. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research 160 (2005) 19-33
13. Birgin E.G., Martínez J.M., Nishihara F.H., and Ronconi D.P. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research 33 (2006) 3535-3548
14. Birgin E.G., Martínez J.M., Mascarenhas W.F., and Ronconi D.P. Method of sentinels for packing objects within arbitrary regions. Journal of the Operational Research Society 57 (2006) 735-746
15. Mascarenhas WF, Birgin EG. Using sentinels to detect intersections. 2006, submitted for publication. [Available in 〈www.ime.usp.br/∼egbirgin/〉].
16. Andreani R, Birgin EG, Martínez JM, Schuverdt ML. On Augmented Lagrangian methods with general lower-level constraints. Technical Report MCDO-050303, Department of Applied Mathematics, UNICAMP, Brazil; 2005 [available in Optimization On Line and in 〈www.ime.usp.br/∼egbirgin/〉].
17. Andreani R, Birgin EG, Martínez JM, Schuverdt ML. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Mathematical Programming, in press, doi:10.1007/s10107-006-0077-1.
18. Birgin E.G., Castillo R., and Martínez J.M. Numerical comparison of Augmented Lagrangian algorithms for nonconvex problems. Computational Optimization and Applications 31 (2005) 31-56
19. Birgin EG, Martínez JM. Structured minimal-memory inexact quasi-Newton method and secant preconditioners for Augmented Lagrangian optimization, Computational Optimization and Applications, to appear.
20. Birgin EG. 〈http://www.ime.usp.br/∼egbirgin/tango/〉.
21. Hockney R.W., and Eastwood J.W. Computer simulation using particles (1981), McGraw Hill, New York
22. Martínez J.M., and Martínez L. Packing optimization for automated generation of complex system's initial configurations for molecular dynamics and docking. Journal of Computational Chemistry 24 (2003) 819-825
23. Stoyan Yu.G. Mathematical methods for geometric design. In: Ellis T.M.R., and Semenkoc O.J. (Eds). Advances in CAD/CAM, Proceedings of PROLAMAT 82, Leningrad (1983), Amsterdam 67-86
24. Appel A.W. An efficient program for many-body simulations. SIAM Journal on Scientific and Statistical Computing 6 (1985) 85-103
25. Barnes J., and Hut P. A hierarchical O (n log n) force calculation algorithm. Nature 324 (1986) 450
26. Greengard L., and Rokhlin V. A fast algorithm for particle simulations. Comp. Phys. 73 (1987)
27. Greengard L, Rokhlin V. The rapid evaluation of potential fields in 3 dimensions. Lecture Notes in Mathematics, vol. 1360, 1988, p. 121-41.
28. Zhao F. An 0 (N) algorithm for three-dimensional n-body simulations. Technical Report, AI-TR-995, MIT Al Lab, Cambridge, MA, 1987.
29. Katzenelson J. Computational structure of the N-body problem. SIAM Journal on Scientific and Statistical Computing 10 (1989) 787-815
30. Wäscher G, Haussner H, Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research, to appear.
31. Birgin E.G., and Martínez J.M. Large-scale active-set box-constrained optimization method with spectral projected gradients. Computational Optimization and Applications 23 (2002) 101-125
32. Birgin E.G., and Martínez J.M. A box constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing 15 Suppl. (2001) 49-60
33. Birgin E.G., Martínez J.M., and Raydan M. Nonmonotone spectral projected gradient methods on convex sets. SIAM Journal on Optimization 10 (2000) 1196-1211
34. Birgin E.G., Martínez J.M., and Raydan M. Algorithm 813: SPG - Software for convex-constrained optimization. ACM Transactions on Mathematical Software 27 (2001) 340-349
35. Specht E. 〈http://www.packomania.com/〉.
36. Friedman E. 〈http://www.stetson.edu/∼efriedma/packing.html〉.
37. Humphrey W., Dalke A., and Schulten K. VMD - visual molecular dynamics. Journal of Molecular Graphics 14 (1996) 33-38
38. Bacon D.J., and Anderson W.F. A fast algorithm for rendering space-filling molecule pictures. Journal of Molecular Graphics 6 (1988) 219-220