The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.PRON...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
The focus of study in this paper is the class of packing problems. More specifically, it deals with ...
The Packing Problems Consist In Arranging Some Subjects Within A Certain Region. In This Work, We St...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
The paper presents a new verified optimization method for the problem of finding the densest packing...
We study a two-dimensional packing problem where rectangular items are placed into a circular contai...
We study a two-dimensional packing problem where rectangular items are placed into a circular conta...
Given a fixed set of identical or different-sized circular items, the problem we deal with consists ...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
In this thesis, we study the Circle Packing Problem (CPP), which involves packing a set of circles i...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
Given a fixed set of identical or different-sized circular items, the problem we deal withconsists o...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
The focus of study in this paper is the class of packing problems. More specifically, it deals with ...
The Packing Problems Consist In Arranging Some Subjects Within A Certain Region. In This Work, We St...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
The paper presents a new verified optimization method for the problem of finding the densest packing...
We study a two-dimensional packing problem where rectangular items are placed into a circular contai...
We study a two-dimensional packing problem where rectangular items are placed into a circular conta...
Given a fixed set of identical or different-sized circular items, the problem we deal with consists ...
AbstractA problem of packing a limited number of unequal circles in a fixed size rectangular contain...
In this thesis, we study the Circle Packing Problem (CPP), which involves packing a set of circles i...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
Given a fixed set of identical or different-sized circular items, the problem we deal withconsists o...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...
This paper concerns the problem to place N non overlapping circles in a circular container with mini...