AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. The results have been found by the use of simulated annealing and a quasi-Newton optimization technique, supplemented with some human intelligence
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 dis...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
We present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. T...
AbstractThe problem of the densest packing of n equal circles in a square has been solved for n<10 i...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 dis...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
We present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. T...
AbstractThe problem of the densest packing of n equal circles in a square has been solved for n<10 i...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 dis...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
DOI
Add to ORKG