NSL OpenIR  > 中国科学院成都文献情报中心  > 信息技术部
Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies
Li-Yuan Xue2; Ceng RQ(曾荣强)1,3; Hu ZY(胡正银)1; Wen Y(文奕)1
2017-10-06
Conference NameInternational Conference on Intelligent Data Engineering and Automated Learning
Conference Date2017.10.30-2017.11.1
Conference Place中国 桂林
DOIhttps://doi.org/10.1007/978-3-319-68935-7_55
Citation statistics
Document Type会议论文
Identifierhttp://ir.las.ac.cn/handle/12502/9599
Collection中国科学院成都文献情报中心_信息技术部
Affiliation1.中国科学院成都文献情报中心
2.电子科技大学
3.西南交通大学
First Author Affilication中国科学院文献情报中心
Recommended Citation
GB/T 7714
Li-Yuan Xue,Ceng RQ,Hu ZY,et al. Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies[C],2017.
Files in This Item: Download All
File Name/Size DocType Version Access License
Solving the Bi-crite(222KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li-Yuan Xue]'s Articles
[Ceng RQ(曾荣强)]'s Articles
[Hu ZY(胡正银)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li-Yuan Xue]'s Articles
[Ceng RQ(曾荣强)]'s Articles
[Hu ZY(胡正银)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li-Yuan Xue]'s Articles
[Ceng RQ(曾荣强)]'s Articles
[Hu ZY(胡正银)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.