A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies
暂无分享,去创建一个
[1] Mhand Hifi,et al. Approximate algorithms for constrained circular cutting problems , 2004, Comput. Oper. Res..
[2] Donguk Kim,et al. Disk packing for the estimation of the size of a wire bundle , 2004 .
[3] Y. Li,et al. Greedy algorithms for packing unequal circles into a rectangular container , 2005, J. Oper. Res. Soc..
[4] Yaodong Cui. Generating optimal T-shape cutting patterns for circular blanks , 2005, Comput. Oper. Res..
[5] Ernesto G. Birgin,et al. Minimizing the object dimensions in circle and sphere packing problems , 2008, Comput. Oper. Res..
[6] G. Scheithauer,et al. Packing of Various Radii Solid Spheres into a Parallelepiped , 2001 .
[7] Yu. G. Stoyan,et al. Packing identical spheres into a cylinder , 2010, Int. Trans. Oper. Res..
[8] Rym M'Hallah,et al. Beam search and non-linear programming tools for the circular packing problem , 2009, Int. J. Math. Oper. Res..
[9] Ronald L. Graham,et al. Repeated Patterns of Dense Packings of Equal Disks in a Square , 1996, Electron. J. Comb..
[10] M. Hifi,et al. A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapes , 2003 .
[11] Fabio Schoen,et al. Dissimilarity measures for population-based global optimization algorithms , 2010, Comput. Optim. Appl..
[12] Mhand Hifi,et al. Adaptive and restarting techniques-based algorithms for circular packing problems , 2008, Comput. Optim. Appl..
[13] Mihály Csaba Markót. Interval methods for verifying structural optimality of circle packing configurations in the unit square , 2007 .
[14] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[15] Jennifer Morse,et al. Determinantal Expression and Recursion for Jack Polynomials , 1999, Electron. J. Comb..
[16] Rym M'Hallah,et al. Adaptive beam search lookahead algorithms for the circular packing problem , 2010, Int. Trans. Oper. Res..
[17] José Fernando Oliveira,et al. A New Upper Bound for the Cylinder Packing Problem , 2001 .
[18] Ira M. Gessel,et al. The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions , 1996, Electron. J. Comb..
[19] Y. Stoyan,et al. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints , 1998 .
[20] Bernardetta Addis,et al. Efficiently packing unequal disks in a circle , 2008, Oper. Res. Lett..
[21] José Mario Martínez,et al. Optimizing the packing of cylinders into a rectangular container: A nonlinear approach , 2005, Eur. J. Oper. Res..
[22] J. A. George,et al. Packing different-sized circles into a rectangular container , 1995 .
[23] Bernardetta Addis,et al. Disk Packing in a Square: A New Global Optimization Approach , 2008, INFORMS J. Comput..
[24] R. B. Kearfott. Rigorous Global Search: Continuous Problems , 1996 .
[25] Yu. G. Stoyan,et al. Packing cylinders and rectangular parallelepipeds with distances between them into a given region , 2009, Eur. J. Oper. Res..
[26] Panos M. Pardalos,et al. New results in the packing of equal circles in a square , 1995, Discret. Math..
[27] Yu.G Stoyan,et al. A mathematical model and a solution method for the problem of placing various-sized circles into a strip , 2004, Eur. J. Oper. Res..
[28] Yu Li,et al. New heuristics for packing unequal circles into a circular container , 2006, Comput. Oper. Res..
[29] Wenqi Huang,et al. Note on: An improved algorithm for the packing of unequal circles within a larger containing circle , 2006, Comput. Ind. Eng..
[30] A. Philipse,et al. Random packings of spheres and spherocylinders simulated by mechanical contraction. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[31] Yu. G. Stoyan,et al. Phi-functions for primary 2D-objects , 2002, Stud. Inform. Univ..
[32] Mhand Hifi,et al. Algorithms for the circular two-dimensional open dimension problem , 2008, Int. Trans. Oper. Res..
[33] Vangelis Th. Paschos,et al. A simulated annealing approach for the circular cutting problem , 2004, Eur. J. Oper. Res..
[34] Roman Słowiński,et al. Intelligent Decision Support , 1992, Theory and Decision Library.
[35] Graham Kendall,et al. A local search approach to a circle cutting problem arising in the motor cycle industry , 2007, J. Oper. Res. Soc..
[36] János D. Pintér,et al. Nonlinear optimization with GAMS /LGO , 2007, J. Glob. Optim..
[37] Tibor Csendes,et al. New Approaches to Circle Packing in a Square - With Program Codes , 2007, Optimization and its applications.
[38] Rym M'Hallah,et al. A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems , 2002, Stud. Inform. Univ..
[39] Mhand Hifi,et al. Packing circles in the smallest circle: an adaptive hybrid algorithm , 2011, J. Oper. Res. Soc..
[40] Inmaculada García,et al. Equal Circles Packing in a Square II. - New Results for up to 100 Circles Using the TAMSASS-PECS Alg , 2000 .
[41] J. Pintér,et al. Nonlinear Optimization in Mathematica with MathOptimizer Professional , 2005 .
[42] Mhand Hifi,et al. A beam search algorithm for the circular packing problem , 2009, Comput. Oper. Res..
[43] Marco Locatelli,et al. Packing equal circles in a square: a deterministic global optimization approach , 2002, Discret. Appl. Math..
[44] Yuriy Stoyan,et al. Packing Identical Spheres into a Rectangular Parallelepiped , 2008 .
[45] Tibor Csendes,et al. Global Optimization in Geometry — Circle Packing into the Square , 2005 .
[46] Ronald L. Graham,et al. Improving Dense Packings of Equal Disks in a Square , 2000, Electron. J. Comb..
[47] Panos M. Pardalos,et al. Optimization Theory: Recent Developments from Mátraháza , 2011 .
[48] José Fernando Oliveira,et al. Cylinder packing by simulated annealing , 2000 .
[49] Mhand Hifi,et al. A dynamic adaptive local search algorithm for the circular packing problem , 2007, Eur. J. Oper. Res..
[50] Ronald L. Graham,et al. Minimum perimeter rectangles that enclose congruent non-overlapping circles , 2009, Discret. Math..
[51] Richard A. Williams,et al. Predicting Packing Characteristics of Particles of Arbitrary Shapes , 2004 .
[52] Dick den Hertog,et al. Maximin Latin Hypercube Designs in Two Dimensions , 2007, Oper. Res..
[53] János D. Pintér,et al. Solving circle packing problems by global optimization: Numerical results and industrial applications , 2008, Eur. J. Oper. Res..
[54] Ronald L. Graham,et al. Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond , 1995, Electron. J. Comb..
[55] Wenqi Huang,et al. A Short Note on a Simple Search Heuristic for the Diskspacking Problem , 2004, Ann. Oper. Res..
[56] Rimvydas Krasauskas. Mathematical Methods in Geometric Design , 1997 .
[57] Frank Harary,et al. A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns , 1996, Discret. Appl. Math..
[58] Tibor Csendes,et al. Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm , 2001 .
[59] Appliquees Joseph Liouville. Dense Packings of Equal Spheres in a Cube , 2004 .
[60] Victor W. Marek,et al. Satisfiability and Computing van der Waerden Numbers , 2003, Electron. J. Comb..
[61] Zhipeng Lü,et al. PERM for solving circle packing problem , 2008, Comput. Oper. Res..
[62] Tibor Csendes,et al. A Reliable Area Reduction Technique for Solving Circle Packing Problems , 2005, Computing.
[63] Nenad Mladenovic,et al. Reformulation descent applied to circle packing problems , 2003, Comput. Oper. Res..
[64] Huaiqing Wang,et al. An improved algorithm for the packing of unequal circles within a larger containing circle , 2002, Eur. J. Oper. Res..
[65] Patric R. J. Östergård,et al. Packing up to 50 Equal Circles in a Square , 1997, Discret. Comput. Geom..
[66] De-fu Zhang,et al. An effective hybrid algorithm for the problem of packing circles into a larger containing circle , 2005, Comput. Oper. Res..
[67] R. Horst,et al. DC Programming: Overview , 1999 .
[68] Marc Roubens,et al. Advances in Operations Research , 1977 .
[69] Fabio Schoen,et al. Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters , 2003, Comput. Optim. Appl..
[70] Yu. G. Stoyan,et al. Covering a compact polygonal set by identical circles , 2010, Comput. Optim. Appl..
[71] Boris D. Lubachevsky,et al. Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio , 2003 .
[72] Jie Wang,et al. Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning , 1999, J. Comb. Optim..
[73] Michael Strube,et al. Anaphora Resolution , 2020, The Oxford Handbook of Computational Linguistics 2nd edition.
[74] O. Hunderi,et al. Curvilinear polygons, finite circle packings, and normal grain growth , 2004 .
[75] Pierre Hansen,et al. Extremal problems for convex polygons , 2005, J. Glob. Optim..
[76] Yang Dai,et al. Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D , 2002 .
[77] Tibor Csendes,et al. A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems , 2005, SIAM J. Optim..