The following publications are possibly variants of this publication:
- Solving Bi-objective Unconstrained Binary Quadratic Programming Problem with Multi-objective Backbone Guided Search AlgorithmLi-Yuan Xue, Rong-Qiang Zeng, Yang Wang, Ming-sheng Shang. icic 2016: 745-753 [doi]
- Path relinking for unconstrained binary quadratic programmingYang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. eor, 223(3):595-604, 2012. [doi]
- A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming ProblemChao Huo, Rong-Qiang Zeng, Yang Wang, Ming-sheng Shang. bic-ta 2016: 10-19 [doi]
- Solving bi-objective flow shop problem with hybrid path relinking algorithmRong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao. asc, 13(10):4118-4132, 2013. [doi]
- Solving bi-objective flow shop problem with multi-objective path relinking algorithmRong-Qiang Zeng, Ming-sheng Shang. icnc 2014: 343-348 [doi]
- An Effective Genetic Algorithm with Uniform Crossover for Bi-objective Unconstrained Binary Quadratic Programming ProblemChao Huo, Rong-Qiang Zeng, Yang Wang, Ming-sheng Shang. ideal 2016: 58-67 [doi]
- A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problemYing Zhou, Jiahai Wang, Ziyan Wu, Keke Wu. kbs, 141:18-30, 2018. [doi]
- Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problemMichele Samorani, Yang Wang 0030, Yang Wang, Zhipeng Lv, Fred W. Glover. heuristics, 25(4-5):629-642, 2019. [doi]