中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
数学与系统科学研究院 [3]
近代物理研究所 [1]
采集方式
OAI收割 [4]
内容类型
期刊论文 [4]
发表日期
2021 [2]
2020 [1]
2016 [1]
学科主题
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Algorithms for the metric ring star problem with fixed edge-cost ratio
期刊论文
OAI收割
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 卷号: 42, 期号: 3, 页码: 499-523
作者:
Chen, Xujin
;
Hu, Xiaodong
;
Jia, Xiaohua
;
Tang, Zhongzheng
;
Wang, Chenhao
  |  
收藏
  |  
浏览/下载:34/0
  |  
提交时间:2022/04/02
Ring star
Approximation algorithms
Heuristics
Local search
Connected facility location
Identifying Top-k Influential Nodes Based on Discrete Particle Swarm Optimization With Local Neighborhood Degree Centrality
期刊论文
OAI收割
IEEE ACCESS, 2021, 卷号: 9, 页码: 21345-21356
作者:
Han, Lihong
;
Zhou, Qingguo
;
Tang, Jianxin
;
Yang, Xuhui
;
Huang, Hengjun
  |  
收藏
  |  
浏览/下载:22/0
  |  
提交时间:2021/12/10
Social networking (online)
Particle swarm optimization
Optimization
Search problems
Integrated circuit modeling
Heuristic algorithms
Social sciences
Discrete particle swarm optimization
local search strategy
neighbourhood degree centrality
top-k influential nodes
social network
Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry
期刊论文
OAI收割
IEEE ACCESS, 2020, 卷号: 8, 页码: 91476-91487
作者:
Hu, Xiaoyin
;
Li, Jianshu
;
Cui, Jinchuan
  |  
收藏
  |  
浏览/下载:54/0
  |  
提交时间:2020/09/23
Fabrics
Search problems
Industries
Layout
Heuristic algorithms
Mathematical model
Biological system modeling
Evaluation function
fabric
no-fit polygon
packing
restricted local search
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
期刊论文
OAI收割
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 卷号: 32, 期号: 1, 页码: 51-66
作者:
Xu, Wei
;
Gong, Fuzhou
  |  
收藏
  |  
浏览/下载:15/0
  |  
提交时间:2018/07/30
Constraint satisfaction problems
Model RB
Random walk
Local search algorithms