Efficiently packing unequal disks in a circle
From MaRDI portal
Publication:924882
DOI10.1016/j.orl.2007.03.001zbMath1151.90035OpenAlexW1993888082MaRDI QIDQ924882
Fabio Schoen, Marco Locatelli, Bernardetta Addis
Publication date: 29 May 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.03.001
Related Items
Dissimilarity measures for population-based global optimization algorithms, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Differential evolution methods based on local searches, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, A memetic algorithm to pack unequal circles into a square, Evolutionary computation solutions to the circle packing problem, A literature review on circle and sphere packing problems: models and methodologies, Local search based heuristics for global optimization: atomic clusters and beyond, Greedy vacancy search algorithm for packing equal circles in a square, Approximation schemes for covering and packing problems in image processing and VLSI, A heuristic approach for packing identical rectangles in convex regions, Benchmarking nonlinear optimization software in technical computing environments, Feasibility in reverse convex mixed-integer programming, Solving the problem of packing equal and unequal circles in a circular container, Clustering methods for large scale geometrical global optimization, Iterated dynamic thresholding search for packing equal circles into a circular container, Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Repeated patterns of dense packings of equal disks in a square
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Space-filling Latin hypercube designs for computer experiments
- Global Optimization of Morse Clusters by Potential Energy Transformations
- Disk Packing in a Square: A New Global Optimization Approach
- Maximin Latin Hypercube Designs in Two Dimensions
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Global optimization on funneling landscapes
