Disk Packing in a Square: A New Global Optimization Approach

References

• Addis B., Locatelli M., Schoen F. Efficiently packing unequal disks in a circle. Oper. Res. Lett. (2008) 36:37–42Crossref, Google Scholar
• Boll D. V., Donovan J., Graham R. L., Lubachevsky B. D. Improving dense packings of equal disks in a square. Electronic J. Combin. (2000) 7(1):R46Crossref, Google Scholar
• Casado L. G., Garcia I., Szabó P. G., Csendes T., Giannessi F., Pardalos P. M., Rapcsák T. Equal circles packing in square II: New results for up to 100 circles using the TAMSASS-PECS algorithm. Optimization Theory: Recent Developments from Mátraháza (2001) 59(Kluwer Academic Publishers, Dordrecht, The Netherlands) 207–224Applied Optimization SeriesCrossref, Google Scholar
• Croft H. G., Falconer K. J., Guy R. K.Unsolved Problems in Geometry (1991) (Springer-Verlag, New York) Crossref, Google Scholar
• de Groot C., Peikert R., Würtz D., Monagan M. Packing circles in a square: A review and new results. System Modelling and Optimization, Proc. 15th IFIP Conf. (1991) Zürich(International Federation for Information Processing, Laxenburg, Austria) 45–54Google Scholar
• Dimnaku A., Kincaid R., Trosset M. W. Approximate solutions of continuous dispersion problems. Ann. Oper. Res. (2005) 136:65–80Crossref, Google Scholar
• Dolan E. D., Moré J. J. Benchmarking optimization software with performance profiles. Math. Programming (2002) 91:201–213Crossref, Google Scholar
• Donev A., Torquato S., Stillinger F. H., Connelly R. A linear programming algorithm to test for jamming in hard–sphere packings. J. Comput. Phys. (2004) 197:139–166Crossref, Google Scholar
• Doye J. P. K. The effect of compression on the global optimization of atomic clusters. Phys. Rev. E (2000) 62:8753–8761Crossref, Google Scholar
• Doye J. P. K., Pinter J. D. Physical perspectives on the global optimization of atomic clusters. Global Optimization: Scientific and Engineering Case Studies (2006) (Springer, New York) 103–140Crossref, Google Scholar
• Doye J. P. K., Leary R. H., Locatelli M., Schoen F. The global optimization of Morse clusters by potential transformations. INFORMS J. Comput. (2004) 16:371–379Link, Google Scholar
• Gensane T. Dense packings of equal spheres in a cube. Electronic J. Combinatorics (2004) 11(1):R33Crossref, Google Scholar
• Gill P. E., Murray W., Saunders M. A. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM J. Optim. (2002) 12:979–1006Crossref, Google Scholar
• Graham R. L., Lubachevsky B. D. Repeated patterns of dense packings of equal disks in a square. Electronic J. Combinatorics (1996) 3(1):R16Crossref, Google Scholar
• Grosso A., Locatelli M., Schoen F. A population based approach for hard global optimization problems based on dissimilarity measures. Optim. Online (2005) January). http://www.optimization-online.org/DB_HTML/2005/02/1056.htmlGoogle Scholar
• Horst R., Tuy H.Global Optimization: Deterministic Approaches (1996) 3rd ed.(Springer, Heidelberg, Germany) Crossref, Google Scholar
• Leary R. H. Global optimization on funneling landscapes. J. Global Optim. (2000) 18:367–383Crossref, Google Scholar
• Lee J., Lee I.-H., Lee J. Unbiased global optimization of Lennard-Jones clusters for N ≤ 201 by conformational space annealing method. Phys. Rev. Lett. (2003) 91(8):080201Crossref, Google Scholar
• Locatelli M. On the multilevel structure of global optimization problems. Comput. Optim. Appl. (2005) 30:5–22Crossref, Google Scholar
• Locatelli M., Raber U. Packing equal circles in a square: A deterministic global optimization approach. Discrete Appl. Math. (2002) 122:139–166Crossref, Google Scholar
• Locatelli M., Schoen F. Efficient algorithms for large scale global optimization: Lennard-Jones clusters. Comput. Optim. Appl. (2003) 26:173–190Crossref, Google Scholar
• Lourenco H. R., Martin O., Stützle T., Glover F., Kochenberger G. Iterated local search. Handbook of Metaheuristics (2002) (Kluwer Academic Publishers, Norwell, MA) 321–353Google Scholar
• Markot M. C., Csendes T. A new verified optimization technique for the “packing circles in a unit square” problems. SIAM J. Optim. (2005) 16:287–318Crossref, Google Scholar
• Nurmela K. J., Oestergard P. R. J. Packing up to 50 equal circles in a square. Discrete Comput. Geometry (1997) 18:111–120Crossref, Google Scholar
• Nurmela K. J., Oestergard P. R. J. More optimal packings of equal circles in a square. Discrete Comput. Geometry (1999) 22:439–457Crossref, Google Scholar
• Schaer J. The densest packing of nine circles in a square. Canadian Math. Bull. (1965) 8:273–277Crossref, Google Scholar
• Schaer J., Meir A. On a geometric extremum problem. Canadian Math. Bull. (1965) 8:21–27Crossref, Google Scholar
• Schwartz B. L. Separating points in a square. J. Recreational Math. (1970) 3:195–204Google Scholar
• Specht E. Packomania. (2003) . Retrieved January 9, 2008, http://www.packomania.comGoogle Scholar
• Szabò P. G. Some new structures for the “equal circles packing in a square” problem. Central Eur. J. Oper. Res. (2000) 8:79–91Google Scholar
• van Dam E., Husslage B., den Hertog D., Melissen H. Maximin Latin hybercube designs in two dimensions. Oper. Res. (2007) 55(1):158–169Link, Google Scholar
• Wales D. J., Doye J. P. K. Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J. Phys. Chemistry A (1997) 101:5111–5116Crossref, Google Scholar
• Wengerodt G. Die dichteste packung von 16 kreisen in einem quadrat. Beiträge Algebra Geometrie (1983) 16:173–190Google Scholar
• Wengerodt G. Die dichteste packung von 14 kreisen in einem quadrat. Beiträge Algebra Geometrie (1987a) 25:25–46Google Scholar
• Wengerodt G. Die dichteste packung von 25 kreisen in einem quadrat. Ann. Univ. Sci. Budapest Eötvös Sect. Math. (1987b) 30:3–15Google Scholar
• Wengerodt G., Kirchner K. Die dichteste packung von 36 kreisen in einem quadrat. Beiträge Algebra Geometrie (1987) 25:147–159Google Scholar