A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming Problem. - Chao Huo; Rong-Qiang Zeng; Yang Wang 098; Mingsheng Shang 001 (BIC-TA (2), 2016)

Solving Bi-objective Unconstrained Binary Quadratic Programming Problem with Multi-objective Backbone Guided Search Algorithm. - Li-Yuan Xue; Rong-Qiang Zeng; Yang Wang 098; Mingsheng Shang 001 (ICIC (2), 2016)

Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm. - Lei Song; Rong-Qiang Zeng; Yang Wang 098; Mingsheng Shang 001 (ICNC-FSKD, 2016)

An Effective Genetic Algorithm with Uniform Crossover for Bi-objective Unconstrained Binary Quadratic Programming Problem. - Chao Huo; Rong-Qiang Zeng; Yang Wang 098; Mingsheng Shang 001 (IDEAL, 2016)

The bipartite quadratic assignment problem and extensions. - Abraham P. Punnen; Yang Wang 098 (Eur. J. Oper. Res., 2016)

The boolean quadratic programming problem with generalized upper bound constraints. - Yang Wang 098; Abraham P. Punnen (Comput. Oper. Res., 2017)

Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem. - Michele Samorani; Yang Wang 030; Yang Wang 098; Zhipeng Lv; Fred W. Glover (J. Heuristics, 2019)

A Novel Evolutionary Sampling Assisted Optimization Method for High-Dimensional Expensive Problems. - Xinjing Wang; G. Gary Wang; Baowei Song; Peng Wang 021; Yang Wang 098 (IEEE Trans. Evol. Comput., 2019)

MobileCount: An efficient encoder-decoder framework for real-time crowd counting. - Peng Wang 015; Chenyu Gao; Yang Wang 098; Hui Li 031; Ye Gao (Neurocomputing, 2020)

Parallel iterative solution-based tabu search for the obnoxious p-median problem. - Jian Chang; Lifang Wang; Jin-Kao Hao; Yang Wang 098 (Comput. Oper. Res., 2021)

Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. - Bo Peng 010; Lifan Wu; Yang Wang 098; Qinghua Wu 002 (Inf. Sci., 2021)

Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem. - Xunhao Gu; Songzheng Zhao; Yang Wang 098 (Discret. Optim., 2022)

A memetic algorithm based on edge-state learning for max-cut. - Zhizhong Zeng; Zhipeng Lü; Xinguo Yu; Qinghua Wu 002; Yang Wang 098; Zhou Zhou (Expert Syst. Appl., 2022)

A three-phase matheuristic algorithm for the multi-day task assignment problem. - Yang Wang 098; Haichao Liu; Bo Peng 010; Haibo Wang 001; Abraham P. Punnen (Comput. Oper. Res., 2023)

Solving the patient admission scheduling problem using constraint aggregation. - Haichao Liu; Yang Wang 098; Jin-Kao Hao (Eur. J. Oper. Res., 2024)

Efficient Adaptive Large Neighborhood Search for Sensor-Weapon-Target Assignment. - Yang Wang 098; Junpeng Wang 010; Jin-Kao Hao; Jianguang Feng (IEEE Trans. Syst. Man Cybern. Syst., 2024)

Collaborative scheduling and routing of home healthcare service across multiple communities. - Yang Wang 098; Wenjie Hu; Jin-Kao Hao; Jianguang Feng (OR Spectr., 2025)