Pages that link to "Item:Q541690"
From MaRDI portal
The following pages link to Global optimization method for finding dense packings of equal circles in a circle (Q541690):
Displaying 20 items.
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- On the global minimum in a balanced circular packing problem (Q315515) (← links)
- An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
- Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
- Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
- Packings of circular discs. How a probabilistic perspective can complete a geometric analysis (Q782893) (← links)
- Interval methods for verifying structural optimality of circle packing configurations in the unit square (Q861900) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- Dense packings of congruent circles in a circle (Q1381854) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
- Dense packing of equal circles on a sphere by the minimum-zenith method: Symmetrical arrangement (Q2725825) (← links)
- On the global minimum of the objective function in a balanced circular packing problem (Q2877174) (← links)
- Disk packing in a square: a new global optimization approach (Q2901032) (← links)
- (Q3640390) (← links)
- Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container (Q6568430) (← links)