[1] Wei Yu, and Zhaohui Liu*, Improved approximation algorithms for some min-max and minimum cycle cover problems. Theoretical Computer Science 654, pp. 45-58, 2016.
[2] Wei Yu, and Zhaohui Liu*, Improved approximation algorithms for min-max and minimum vehicle routing problems. Lecture Notes in Computer Science 9198, pp. 147-158, 2015.
[3] Wei Yu, Zhaohui Liu*, and Xiaoguang Bao, Optimal deterministic algorithms for some variants of online quota traveling salesman problem. European Journal of Operational Research 238, pp. 735-740, 2014.
[4] Wei Yu, and Zhaohui Liu*, Vehicle routing problems with regular objective functions on a path. Naval Research Logistics 61, pp. 34-43, 2014.
[5] Yukun Cheng, Wei Yu, and Guochuan Zhang*, Strategy-proof approximation mechanisms for obnoxious facility game on networks. Theoretical Computer Science 497, pp. 154-163, 2013.
[6] Wei Yu, Mordecai Golin, and Guochuan Zhang*, Vehicle scheduling on a graph revisited, Lecture Notes in Computer Science 7676, pp. 362-371, 2012.
[7] Wei Yu, and Guochuan Zhang*, Improved approximation algorithms for routing shop scheduling, Lecture Notes in Computer Science 7074, pp. 30-39, 2011.
[8] Wei Yu, Zhaohui Liu*, Leiyang Wang, and Tijun Fan, Routing flow shop and open shop scheduling problems, European Journal of Operational Research 213, pp. 24-36, 2011.
[9] Wei Yu, and Zhaohui Liu*, Single-vehicle scheduling problems with release and service times on a line, Networks 57(2), pp. 128-134, 2011.
[10] Wei Yu, and Zhaohui Liu*, Vehicle routing problems on a line-shaped network with release time constraints, Operations Research Letters 37, pp. 85-88, 2009.