Iterated dynamic thresholding search for packing equal circles into a circular container
type: Item
instance of: scholarly article
title: Iterated dynamic thresholding search for packing equal circles into a circular container
zbMATH Open document ID: 1495.90157
author: Xiangjing Lai
author: Jin-Kao Hao
author: Dong Yue
author: Zhipeng Lü
author: Zhanghua Fu
published in: European Journal of Operational Research
publication date: 2022-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 7479785
zbMATH Keywords: packing
zbMATH Keywords: thresholding search
zbMATH Keywords: global optimization
zbMATH Keywords: heuristics
describes a project that uses: L-BFGS
describes a project that uses: Packmol
describes a project that uses: packomania
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.08.044
OpenAlex ID: W3197876480
cites work: Disk packing in a square: a new global optimization approach
cites work: Efficiently packing unequal disks in a circle
cites work: Discrete and Computational Geometry
cites work: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
cites work: Minimizing the object dimensions in circle and sphere packing problems
cites work: Improving dense packings of equal disks in a square
cites work: Solving circle packing problems by global optimization: numerical results and industrial applications
cites work: Efficient algorithm for placing a given number of base stations to cover a convex region
cites work: Global optimization of Morse clusters by potential energy transformations
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: The densest packing of 19 congruent circles in a circle
cites work: Iterated tabu search for the circular open dimension problem
cites work: Linear models for the approximate solution of the problem of packing equal circles into a given domain
cites work: Dense packings of congruent circles in a circle
cites work: Combinatorial configurations in balance layout optimization problems
cites work: Solving the problem of packing equal and unequal circles in a circular container
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
cites work: A dynamic adaptive local search algorithm for the circular packing problem
cites work: A local search-based method for sphere packing problems
cites work: Greedy vacancy search algorithm for packing equal circles in a square
cites work: Global optimization method for finding dense packings of equal circles in a circle
cites work: Packing Cylinders into Cylindrical Containers
cites work: Global optimization on funneling landscapes
cites work: On the limited memory BFGS method for large scale optimization
cites work: Packing equal circles in a square: A deterministic global optimization approach
cites work: Fast global optimization of difficult Lennard-Jones clusters
cites work: A heuristic for the circle packing problem with a variety of containers
cites work: Packing unequal circles using formulation space search
cites work: A formulation space search heuristic for packing unequal circles in a fixed size circular container
cites work: PERM for solving circle packing problem
cites work: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
cites work: Densest packings of eleven congruent circles in a circle
cites work: Reformulation descent applied to circle packing problems
cites work: Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
cites work: High density packings of equal circles in rectangles with variable aspect ratio
cites work: On the global minimum in a balanced circular packing problem
cites work: Packing unequal spheres into various containers
cites work: Packing unequal circles into a strip of minimal length with a jump algorithm
cites work: Optimized packing multidimensional hyperspheres: a unified approach
cites work: An improved algorithm for the packing of unequal circles within a larger containing circle
cites work: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
cites work: An effective hybrid algorithm for the problem of packing circles into a larger containing circle
DOI: 10.1016/J.EJOR.2021.08.044
description: scientific article; zbMATH DE number 7479785