期刊
DISCRETE APPLIED MATHEMATICS
卷 122, 期 1-3, 页码 139-166出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0166-218X(01)00359-6
关键词
global optimization; circle packing; branch and bound
In this paper the problem of packing n equal circles into the unit square will be considered. Starting from a general rectangular branch-and-bound algorithm, many tools, which exploit the special structure of the problem and properties fulfilled by some of its solutions, will be introduced and discussed. Computational results will be presented and, in particular, the optimality within a given tolerance of best known solutions in the literature for n = 10-35, n = 38, 39 will be proved, with the exception of the case n = 32 for which a new solution has been detected and proved to be optimal within the given tolerance. Moreover, a new solution for n = 37 has been detected, but not yet proved to be optimal within the given tolerance. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据