首页> 外国专利> Determining a Minimum Cost Solution for Resolving Covering-By-Pairs Problem

Determining a Minimum Cost Solution for Resolving Covering-By-Pairs Problem

机译:确定解决双覆盖问题的最低成本解决方案

摘要

In one method for determining a minimum cost solution for resolving a covering-by-pairs problem, a plurality of covering nodes, a plurality of branch nodes, and a plurality of edges connecting the covering nodes and the branch nodes are given. A plurality of vectors are generated. For each vector in the plurality of vectors, it is determined whether the selected covering nodes cover the branch nodes. Responsive to determining that the selected covering nodes do not cover the branch nodes, each vector is completed so that the selected covering nodes cover the branch nodes. Responsive to determining that selected covering nodes cover the branch nodes or to completing the vector, redundant covering nodes are removed from each vector. The vectors are inserted into a current population. A new population is generated by evolving the current population for at least one generation.
机译:在确定用于解决逐对覆盖问题的最小成本解决方案的一种方法中,给出了多个覆盖节点,多个分支节点以及连接覆盖节点和分支节点的多个边缘。产生多个向量。对于多个向量中的每个向量,确定所选择的覆盖节点是否覆盖分支节点。响应于确定所选择的覆盖节点不覆盖分支节点,完成每个矢量,使得所选择的覆盖节点覆盖分支节点。响应于确定选定的覆盖节点覆盖分支节点或完成向量,从每个向量中删除了多余的覆盖节点。载体被插入到当前种群中。通过将当前人口进化至少一代来产生新的人口。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号