您要查找的是不是：
- In order to resolve the minimal set covering problem availably, the sticker model of DNA computation based on sticking operations is introduced. 摘要运用DNA计算模式中基于粘贴运算的粘贴模型求解最小集合覆盖问题。
- We used the well-known set covering problem (SCP) to model the vehicle routing problem and developed a Lagrangian relaxation based heuristics. 本研究将车辆路线问题转以集合涵盖问题描述，再以常用之拉氏松弛法为基础，结合变数产生法之观念来设计一启发式演算法。
- Han, A. F. (1994), "Hybrid Heuristic Methods for Set Covering Problem," paper presented at the TIMS/ORSA Joint National Meeting, Boston, USA, April 24-27, 1994. 韩复华;游进俊(1993);"静态拨召服务问题启发式解法之研究;"中华民国运输学会第八届学术论文研讨会论文集;473至480页;民国82年12月.
- With the aid of sticker model, the minimal set covering problem can be solved by transforming the subset to memory complex and utilizing the massive parallelism of sticking operations. 在粘贴模型中，用存储复合体来表示子集，并利用粘贴运算的巨大并行性，可以有效地求解最小集合覆盖问题。
- A Heuristic Algorithm for Set Covering Problem 一种求解集合覆盖问题的启发式算法
- Scatter Search for Multi-allocation Hub Set Covering Problem 多分配枢纽站集覆盖问题及分散搜索算法实现
- A Study of Reduction of Attributes and Set Covering Problem 关于属性约简和集合覆盖问题的探讨
- Study on genetic algorithm application in set covering problem 一种遗传算法在集合覆盖问题中的应用研究
- Combinational Analysis for a Class of Set Covering Problem 一类覆盖问题的组合学分析
- Attribute reduction way of incomplete information system based on set covering problem 基于集合覆盖的不完备信息系统属性约简方法
- Designing a simulative model for the forecast and optimal placement of casualty evacuation assets based on the probabilistic location set covering problem 基于随机性集合覆盖模型的伤病员后送运力预计及优化配置仿真模型设计
- Can the radar set cover the whole area? 雷达装置能覆盖整个地区吗?
- set covering problem 集合覆盖问题
- set covering problem (SCP) 覆盖问题
- set cover problem 集合覆盖问题
- Weighted set cover problem 带权集合覆盖
- The optimization quality and computation time of set covering arid tabu search algorithms were analyzed and compared. 摘要分析和比较了集合覆盖和禁忌搜索两种高效布局算法的优化性能和计算时间。
- A variation of one-dimensional bin packing problem: the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed. 摘要文章介绍一维装箱问题的一个衍生问题：最小基数箱子覆盖问题和它的一个启发式算法。
- It is now our aim to set up a factory. 我们现在的目的是创办一座工厂。
- The terminal path cover problem is to find a terminal path cover of G of minimum cardinality with respect to T. 终端路迳覆盖问题在于找到一个相对于T的G上最少路迳数的终端路迳覆盖。
