Pages that link to "Item:Q855072"
From MaRDI portal
The following pages link to New approaches to circle packing in a square. With program codes. (Q855072):
Displaying 10 items.
- Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
- A bounded space algorithm for online circle packing (Q5964819) (← links)
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
- The repeated <i>p</i>-dispersion problem (Q6155626) (← links)
- Efficient algorithms for the dense packing of congruent circles inside a square (Q6156095) (← links)
- The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)
- Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
- Different formulations of the gray pattern problem and their optimal solutions (Q6586256) (← links)
- Packing spheres with quasi-containment conditions (Q6631568) (← links)
- (Re)packing equal disks into rectangle (Q6642301) (← links)