中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共11条，第1-10条 帮助

条数/页： 排序方式：
A proximal DC approach for quadratic assignment problem 期刊论文  OAI收割
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 页码: 27
作者:  Jiang, Zhuoxuan;  Zhao, Xinyuan;  Ding, Chao
  |  收藏  |  浏览/下载：18/0  |  提交时间：2021/04/26
L-p-NORM REGULARIZATION ALGORITHMS FOR OPTIMIZATION OVER PERMUTATION MATRICES 期刊论文  OAI收割
SIAM JOURNAL ON OPTIMIZATION, 2016, 卷号: 26, 期号: 4, 页码: 2284-2313
作者:  Jiang, Bo;  Liu, Ya-Feng;  Wen, Zaiwen
  |  收藏  |  浏览/下载：27/0  |  提交时间：2018/07/30
A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing 期刊论文  OAI收割
INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES, 2015, 卷号: 16, 期号: 10, 页码: 882-893
作者:  Wang, Zhaocai;  Pu, Jun;  Cao, Liling;  Tan, Jian
收藏  |  浏览/下载：23/0  |  提交时间：2016/04/20
GNCCP-Graduated NonConvexity and Concavity Procedure 期刊论文  OAI收割
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2014, 卷号: 36, 期号: 6, 页码: 1258-1267
作者:  Liu, Zhi-Yong;  Qiao, Hong
收藏  |  浏览/下载：47/0  |  提交时间：2015/08/12
An Unsupervised Classification Method of Remote Sensing Images Based on Ant Colony Optimization Algorithm 会议论文  OAI收割
Advanced Data Mining and Applications, Adma 2010, Pt I
Wang, Duo; Cheng, Bo
收藏  |  浏览/下载：17/0  |  提交时间：2014/12/07
An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文  OAI收割
2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China
作者:  Wang C.
收藏  |  浏览/下载：14/0  |  提交时间：2013/03/25
Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.  
Modeling and Solution for Assignment Problem 期刊论文  OAI收割
International Journal of Mathematical Models and Methodes in Applied Sciences, 2008, 卷号: 2, 期号: 2, 页码: 205-212
作者:  Yang LY(杨丽英);  Nie MH(聂明泓);  Wu ZW(吴镇炜);  Nie YY(聂义勇)
收藏  |  浏览/下载：21/0  |  提交时间：2012/05/29
The operations on matrix for assignment problem 会议论文  OAI收割
Conference on Advances in Applied Mathematics, Systems, Communications and Computers, Marathon Beach, GREECE, June 1-3, 2008
作者:  Yang LY(杨丽英);  Nie MH(聂明泓);  Wu ZW(吴镇炜);  Nie YY(聂义勇)
收藏  |  浏览/下载：21/0  |  提交时间：2012/06/06
Partial inverse assignment problems under l(1) norm 期刊论文  OAI收割
OPERATIONS RESEARCH LETTERS, 2007, 卷号: 35, 期号: 1, 页码: 23-28
作者:  Yang, Xiaoguang;  Zhang, Jianzhong
  |  收藏  |  浏览/下载：16/0  |  提交时间：2018/07/30
A new linearization method for quadratic assignment problems 期刊论文  OAI收割
OPTIMIZATION METHODS & SOFTWARE, 2006, 卷号: 21, 期号: 5, 页码: 805-818
作者:  Xia, Y;  Yuan, YX
  |  收藏  |  浏览/下载：19/0  |  提交时间：2018/07/30