A Cooperative Method for Solving the Set-Union Knapsack Problem. - Juntao Zhao 003; Mhand Hifi (CoDIT, 2024)

Tackling the Generalized Max-Mean Dispersion Problem with a Hybrid Population Method. - Juntao Zhao 003; Mhand Hifi (CoDIT, 2024)

An incremental method-based machine learning approach for max-min knapsack with multiple scenarios. - Juntao Zhao 003; Mhand Hifi; Yulin Zhang 002; Xiaochuan Luo (Comput. Ind. Eng., 2024)

An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem. - Juntao Zhao 003; Mhand Hifi (Inf. Sci., 2024)

A population-based simulated annealing approach with adaptive mutation operator for solving the discounted {0-1} knapsack problem. - Juntao Zhao 003; Xiaochuan Luo (Appl. Soft Comput., 2025)

Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem. - Juntao Zhao 003; Mhand Hifi (Comput. Oper. Res., 2025)

An Effective Iterated Search for the Profitable Tour Problem With Simultaneous Pickup and Delivery. - Juntao Zhao 003; Mhand Hifi; Xiaochuan Luo (IEEE Trans. Intell. Transp. Syst., 2025)