首页> 外文期刊>INFORMS journal on computing >An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy
【24h】

An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy

机译:调强放疗治疗计划中最小基数问题的精确方法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we introduce an exact method based on constraint programming ideas for a combinatorial optimization problem that arises from the treatment planning of intensity-modulated radiotherapy-the minimum cardinality problem (MCP). The MCP is to find a decomposition of a given integer matrix into a weighted sum of binary matrices with consecutive ones, such that the number of such binary matrices is minimised. We compare our method with two recent exact methods for the same problem and a recent exact method for a special case of the problem. Numerical results are presented that indicate that our method is computationally more efficient than the three existing methods.
机译:在本文中,我们针对约束优化思想引入了一种精确的方法,用于组合优化问题,该优化问题来自强度调制放射疗法的治疗计划-最小基数问题(MCP)。 MCP将找到一个给定的整数矩阵分解为具有连续矩阵的二进制矩阵的加权总和,以使此类二进制矩阵的数量最小化。我们将我们的方法与针对同一问题的两个最近的精确方法以及针对问题的特殊情况的一个最近的精确方法进行比较。数值结果表明,我们的方法在计算上比现有的三种方法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号