Ying Zhou. A Decomposition-Based Multi-Objective Tabu Search Algorithm for Tri-Objective Unconstrained Binary Quadratic Programming Problem. In 2017 IEEE International Conference on Computational Science and Engineering, CSE 2017, and IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2017, Guangzhou, China, July 21-24, 2017, Volume 1. pages 101-107, IEEE Computer Society, 2017. [doi]
@inproceedings{Zhou17-21,
title = {A Decomposition-Based Multi-Objective Tabu Search Algorithm for Tri-Objective Unconstrained Binary Quadratic Programming Problem},
author = {Ying Zhou},
year = {2017},
doi = {10.1109/CSE-EUC.2017.28},
url = {http://doi.ieeecomputersociety.org/10.1109/CSE-EUC.2017.28},
researchr = {https://researchr.org/publication/Zhou17-21},
cites = {0},
citedby = {0},
pages = {101-107},
booktitle = {2017 IEEE International Conference on Computational Science and Engineering, CSE 2017, and IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2017, Guangzhou, China, July 21-24, 2017, Volume 1},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-3221-5},
}