A tabu search/path relinking algorithm to solve the job shop scheduling problem. - Bo Peng 010; Zhipeng Lü; T. C. E. Cheng (Comput. Oper. Res., 2015)

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. - Tao Qin; Bo Peng 010; Una Benlic; T. C. E. Cheng; Yang Wang 030; Zhipeng Lü (Comput. Oper. Res., 2015)

A hybrid evolutionary algorithm to solve the job shop scheduling problem. - T. C. E. Cheng; Bo Peng 010; Zhipeng Lü (Ann. Oper. Res., 2016)

An ejection chain approach for the quadratic multiple knapsack problem. - Bo Peng 010; Mengqi Liu; Zhipeng Lü; Gary A. Kochenberger; Haibo Wang 001 (Eur. J. Oper. Res., 2016)

Multi-start iterated tabu search for the minimum weight vertex cover problem. - Taoqing Zhou; Zhipeng Lü; Yang Wang 030; Junwen Ding; Bo Peng 010 (J. Comb. Optim., 2016)

Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. - Junwen Ding; Liji Shen; Zhipeng Lü; Bo Peng 010 (Comput. Oper. Res., 2019)

Memetic algorithm for the multiple traveling repairman problem with profits. - Yongliang Lu; Una Benlic; Qinghua Wu 002; Bo Peng 010 (Eng. Appl. Artif. Intell., 2019)

A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading. - Bo Peng 010; Yuan Zhang; Zhipeng Lü; T. C. E. Cheng; Fred W. Glover (Comput. Ind. Eng., 2020)

Adaptive memory programming for the dynamic bipartite drawing problem. - Bo Peng 010; Donghao Liu; Zhipeng Lü; Rafael Martí; Junwen Ding (Inf. Sci., 2020)

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. - Bo Peng 010; Yuan Zhang; T. C. E. Cheng; Zhipeng Lü; Abraham P. Punnen (Knowl. Based Syst., 2020)

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)

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)

A fast path relinking algorithm for the min-max edge crossing problem. - Bo Peng 010; Lunwen Wu; Rafael Martí; Jiangshui Ma (Comput. Oper. Res., 2024)

Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm. - Bo Peng 010; Songge Wang; Donghao Liu; Zhouxing Su; Zhipeng Lü; Fred W. Glover (Expert Syst. Appl., 2024)