中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共6条,第1-6条 帮助

条数/页: 排序方式:
An improved monkey algorithm for a 0-1 knapsack problem 期刊论文  OAI收割
APPLIED SOFT COMPUTING, 2016, 卷号: 38, 页码: 817-830
作者:  
Zhou, Yongquan;  Chen, Xin;  Zhou, Guo
  |  收藏  |  浏览/下载:17/0  |  提交时间:2019/12/13
Some new results on Multi-Dimension Knapsack Problem 期刊论文  OAI收割
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2005, 卷号: 1, 期号: 3, 页码: 315-321
作者:  
Zhang, Yuzhong;  Zhang, Fan;  Cai, Maocheng
  |  收藏  |  浏览/下载:14/0  |  提交时间:2018/07/30
Inverse problems of some NP-complete problems 期刊论文  OAI收割
ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS, 2005, 卷号: 3521, 期号: 1, 页码: 5,422-426
Huang, SM
收藏  |  浏览/下载:14/0  |  提交时间:2012/11/12
A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting 会议论文  OAI收割
2004 IADIS International Conference Applied Computing, Lisbon, Portugal, March 23-26, 2004
作者:  
Song X(宋翔);  Chu CB(储诚斌);  Nie YY(聂义勇)
收藏  |  浏览/下载:15/0  |  提交时间:2012/10/16
Cryptanalysis of a knapsack based two-lock cryptosystem 期刊论文  iSwitch采集
Applied cryptography and network security, proceedings, 2004, 卷号: 3089, 页码: 303-309
作者:  
Zhang, B;  Wu, HJ;  Feng, DG;  Bao, F
收藏  |  浏览/下载:12/0  |  提交时间:2019/05/10
Incompletely Enumerative Solution for 1D Cutting-Stock Problem 期刊论文  OAI收割
Far East Journal of Mathematical Sciences, 2002, 卷号: 5, 期号: 1, 页码: 25-46
作者:  
Song X(宋翔);  Nie YY(聂义勇);  Gui G(贵刚)
收藏  |  浏览/下载:17/0  |  提交时间:2012/05/29