A modeling language for mathematical programming
Management Science
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
SIAM Journal on Optimization
Global Optimization on Funneling Landscapes
Journal of Global Optimization
Packing equal circles in a square: a deterministic global optimization approach
Discrete Applied Mathematics
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
Computers and Operations Research
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
SIAM Journal on Optimization
Maximin Latin Hypercube Designs in Two Dimensions
Operations Research
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures
Mathematical Programming: Series A and B
Global Optimization of Morse Clusters by Potential Energy Transformations
INFORMS Journal on Computing
Dissimilarity measures for population-based global optimization algorithms
Computational Optimization and Applications
Solving the problem of packing equal and unequal circles in a circular container
Journal of Global Optimization
A heuristic approach for packing identical rectangles in convex regions
Computers and Operations Research
Greedy vacancy search algorithm for packing equal circles in a square
Operations Research Letters
Packing unequal circles using formulation space search
Computers and Operations Research
Computers and Industrial Engineering
Differential evolution methods based on local searches
Computers and Operations Research
| Hi-index | 0.00 |
Placing non-overlapping circles in a smallest container is a hard task. In this paper we present our strategy for optimally placing circles in a smallest circle which led us to win an international competition by properly mixing local and global optimization strategies with random search and local moves.