Scholarlink

<p>The paper addresses the problem of packing pairwise unequal circles into the circle of minimal radius centered at the origin. This problem with an additional balance condition is considered as well. The corresponding optimization models are highly nonconvex. Symmetry breaking constraints are developed to reduce the number of solutions. It is proved that these additional linear constraints avoid solutions coming from rotations and certain reflections. In addition, problems with subsets of equally sized circles are dealt with as well. Computational experiments based on small benchmark instances demonstrate significant savings in runtime for the global solver BARON if models with symmetry breaking constraints are employed.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Symmetry breaking constraints for packing unequal circles into a minimal outer circle

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年1月12日

查看全文
  • Andreas Fischer,
  • Tetyana Romanova,
  • Petro Stetsyuk,
  • Stanislav Tyvodar

摘要

The paper addresses the problem of packing pairwise unequal circles into the circle of minimal radius centered at the origin. This problem with an additional balance condition is considered as well. The corresponding optimization models are highly nonconvex. Symmetry breaking constraints are developed to reduce the number of solutions. It is proved that these additional linear constraints avoid solutions coming from rotations and certain reflections. In addition, problems with subsets of equally sized circles are dealt with as well. Computational experiments based on small benchmark instances demonstrate significant savings in runtime for the global solver BARON if models with symmetry breaking constraints are employed.