Efficiently packing unequal disks in a circle

Efficiently packing unequal disks in a circle

0.00 Avg rating0 Votes
Article ID: iaor2009648
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 37
End Page Number: 42
Publication Date: Jan 2008
Journal: Operations Research Letters
Authors: , ,
Keywords: geometry, packing
Abstract:

Placing non-overlapping circles in a smallest container is a hard task. In this paper we present our strategy for optimally placing circles in a smallest circle which led us to win an international competition by properly mixing local and global optimization strategies with random search and local moves.

Reviews

Required fields are marked *. Your email address will not be published.