| 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 Name | International Conference on Intelligent Data Engineering and Automated Learning |
| Conference Date | 2017.10.30-2017.11.1 |
| Conference Place | 中国 桂林 |
| DOI | https://doi.org/10.1007/978-3-319-68935-7_55 |
| Citation statistics | |
| Document Type | 会议论文 |
| Identifier | http://ir.las.ac.cn/handle/12502/9599 |
| Collection | 中国科学院成都文献情报中心_信息技术部 |
| Affiliation | 1.中国科学院成都文献情报中心 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-SA | View Download | ||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment