Packing congruent hyperspheres into a hypersphere

Journal of Global Optimization

Volumn 52, Issue 4, 2012, Pages 855-868

  Stoyan, Yuriy ^a   Yaskov, Georgiy ^a  

^a Institute of Mechanical Engineering Problems   (Ukraine)

Author keywords

Hexagonal lattice; Hypersphere; Mathematical model; Optimization; Packing

Indexed keywords

FEASIBLE DIRECTION METHODS; GLOBAL MAXIMUM; HEXAGONAL LATTICE; HYPERSPHERE; LATTICE PACKINGS; LOCAL MAXIMUM; NUMERICAL RESULTS; SOLUTION APPROACH;

MATHEMATICAL MODELS; OPTIMIZATION; PACKING;

PROBLEM SOLVING;

EID: 84875653446     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9716-z     Document Type: Article

References (21)

1. Akeb, H.; Li, Y.: Basic heuristics for packing a large number of equal circles. Publications internes du LaRIA, LaRIA, Universite de Picardie Jules Verne. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.6590 (2005)
2. Akeb, H.; Li, Y.: A basic heuristic for packing equal circles into a circular container. Publications internes du LaRIA, LaRIA, Universite de Picardie Jules Verne. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1. 108.8530 (2005)
3. Birgin E.G.; Sobral F.N.C.: Minimizing the object dimensions in circle and sphere packing problems. Comput. Oper. Res. 35, 2357-2375 (2008)
4. Conway J.H.; Sloane N.J.A.: Sphere Packings, Lattices, and Groups. Springer, New York (1999)
5. Gondzio J.: HOPDM (version 2.12): A fast LP solver based on a primal-dual interior point method. Eur. J. Oper. Res. 85(1), 221-225 (1995)
6. Grosso, A.; Jamali, J.U.; Locatelli, M.; Schoen, F.: Solving the problem of packing equal and unequal circles in a circular container. Optimization online (2008)
7. Hales T.C.: A proof of the Kepler conjecture. Ann. Math 162(1), 065-1185 (2005)
8. Hifi, M.; M'Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. (2009)
9. Hürlimann T.: Modeling languages in optimization a new paradigm. In: Floudas, C.A.; Pardalos, P.M. (eds) Encyclopedia of Optimization, 2nd Edn.; pp. 2297-2304. Springer, New York (2009)
10. Kallrath J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim 43, 299-328 (2009)
11. Lenstra, J.K.; Rinnooy, A.H.G.: Complexity of packing, covering, and partitioning problems. In: Schrijver, A. (ed.) Packing and Covering in Combinatorics, pp. 275-291. Mathematisch Centrum, Amsterdam (1979)
12. Maranas C.D.; Floudas C.A.; Pardalos P.M.: New results in the packing of equal circles in a square. Discret. Math. 142(1-3), 287-293 (1995)
13. Liu J. et al.: An effective hybrid algorithm for the circles and spheres packing problems. In: Du, D.-Z.; Hu, X.; Pardalos, P.M. (eds) COCOA 2009, LNCS, vol. 5573, pp. 135-144. Springer, New York (2009)
14. Skoge M.; Donev A.; Stillinger F.H.; Torquato S.: Packing hyperspheres in high-dimensional Euclidean spaces. Phys. Rev. E 74, 041127 (2006)
15. Stoyan Y.; Chugay A.: Packing cylinders and rectangular parallelepipeds with distances between them into a given region. Eur. J. Oper. Res. 197, 446-455 (2009)
16. Stoyan Y.; Yaskov G.: Packing identical spheres into a rectangular parallelepiped. In: Bortfeldt, A.; Homberger, J.; Kopfer, H.; Pankratz, G.; Strangmeier, R. (eds) Intelligent Decision Support Current Challenges and Approaches, Wiesbaden: Betriebswirtschaftlicher, pp. 46-67. Verlag Dr. Th. Gabler, GWV Fachverlage GmbH (2008)
17. Tawarmalani M.; Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225-249 (2005)
18. Torquato S.: Exactly solvable disordered sphere-packing model in arbitrary-dimensional Euclidean spaces. Phys. Rev. E 73, 031106 (2006)
19. Toth L.F.: Über einem geometrischen Satz. Mathematische Zeitschrift 46, 83-85 (1940) (In German)
20. Zoutendijk, G.: Nonlinear programming, computational methods, integer and nonlinear programming. In: Aadie, J. (ed.) North Holland, Amsterdam (1979)
21. http://hydra.nat.uni-magdeburg.de/packing/cci/cci.html