set covering 英[set ˈkʌvərɪŋ] 美[sɛt ˈkʌvərɪŋ] 释义 集合覆盖 行业词典 计算机 集覆盖,系覆盖
set covering 美 英 un.集覆盖 网络集合覆盖 英汉 网络释义 un. 1. 集覆盖 释义: 全部,集覆盖,集合覆盖 1. Theoptimizationqualityandcomputationtimeofsetcoveringaridtabusearchalgorithmswereanalyzedandcompared. 分析和比较了集合覆盖和禁忌搜索两种高效布局算法的优化性能和计算时间。
covering of an electrode 焊条的药皮 covering surface 覆盖面,覆盖曲面 covering tape 绝缘包布,绝缘包布 inside covering 内套 相似单词 covering n. 1.覆盖物,遮避物 2.装饰性覆盖物 set v.[T] 1.放,置;竖立 2.(只用被动语态)使坐落;使处于特定位置 3.安装 4.安排 5.使接触(to) 6.【主...
set covering英语 标准发音:set covering 英式发音: 美式发音: 翻译中文 设置覆盖层 set covering - 基本释义[词典1] 覆盖 覆盖集 涵盖 涵盖问题 set covering - WEB词典 set covering 集覆盖 覆盖 合覆盖 合涵盖问题 set of covering vertices 覆盖顶点集 set-covering 节约覆盖集 参考资料: 1.百度翻译:set ...
set-covering是什么意思_set-covering用英语怎么说_set-covering的翻译_set-covering翻译成_set-covering的中文意思_set-covering怎么读,set-covering的读音,set-covering的用法,set-covering的例句 翻译 set-covering 翻译 集覆盖 以上结果来自机器翻译。 释义
1. Scatter Search for Multi-allocation Hub Set Covering Problem; 多分配枢纽站集覆盖问题及分散搜索算法实现更多例句>> 2) set covering 集合覆盖 1. Attribute reduction way of incomplete information system based on set covering problem; 基于集合覆盖的不完备信息系统属性约简方法 2. A Study of ...
The Set Covering Problem (SCP) is a combinatorial optimization problem that involves finding the minimum size subset of sets that covers a given finite set. It has numerous real-world applications, such as crew scheduling, driver scheduling, and production planning. In the Weighted SCP variant, ...
covering n. 1.覆盖物,遮避物 2.装饰性覆盖物 problem n.[C] 1.棘手的问题;难题;困难 2.逻辑题;数学题 a.[only before noun]找麻烦的;成问题的;惹乱子的 set v.[T] 1.放,置;竖立 2.(只用被动语态)使坐落;使处于特定位置 3.安装 4.安排 5.使接触(to) 6.【主美】放(火);点燃(火) 7...
Finally, we design an algorithm framework based on the lower bound for solving the set covering in general FVRP. Simulation results demonstrate the effectiveness of the algorithms for solving the set covering in FVRP-TW and general FVRP.
This pure 0–1 linear programming problem is called the set covering problem . When the inequalities are replaced by equations the problem is called the set partitioning problem , and when all of the ≥ constraints are replaced by ≤ constraints, the problem is called the set packing problem ...