Add to ORKGIn a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square with up to ten equal circles. We will give improved coverings with six and eight circles and a new, thin covering with eleven circles, found by the use of simulated annealing. Furthermore, we present a combinatorial method for constructing lower bounds for the optimal covering radius
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractA (v,k,t)covering design, orcovering, is a family ofk-subsets, calledblocks, chosen from av-...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
Recently, M~lissen has determined the thinnest coverings of an equilateral tri-angle with 1,...,6, a...
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 present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
We consider the optimal covering of the unit square by N circles. By optimal, we mean the covering t...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractA (v,k,t)covering design, orcovering, is a family ofk-subsets, calledblocks, chosen from av-...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
Recently, M~lissen has determined the thinnest coverings of an equilateral tri-angle with 1,...,6, a...
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 present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
We consider the optimal covering of the unit square by N circles. By optimal, we mean the covering t...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractA (v,k,t)covering design, orcovering, is a family ofk-subsets, calledblocks, chosen from av-...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...