| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143197 | Operations Research Letters | 2008 | 6 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bernardetta Addis, Marco Locatelli, Fabio Schoen,