Wei Yu

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 19

Top Topics

Routing Problem

Constant Factor

Approximation Algorithms

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Inf. Process. Lett.

Publications

Shiming Li, Wei Yu, Zhaohui Liu
A local search algorithm for the k-path partition problem. Optim. Lett. 18 (1) (2024)
Wei Yu
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover. Math. Methods Oper. Res. 97 (1) (2023)
Yuhui Sun, Wei Yu, Zhaohui Liu
Approximation algorithms for some min-max and minimum stacker crane cover problems. J. Comb. Optim. 45 (1) (2023)
Wei Yu, Zhaohui Liu
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints. Inf. Process. Lett. 178 (2022)
Yichen Yang, Zhaohui Liu, Wei Yu
Approximation algorithms for the k-depots Hamiltonian path problem. Optim. Lett. 16 (4) (2022)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. J. Comb. Optim. 43 (5) (2022)
Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
Approximation algorithms for some Minimum Postmen Cover Problems. Discret. Appl. Math. 319 (2022)
Yuhui Sun, Wei Yu, Zhaohui Liu
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems. COCOA (2021)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300 (1) (2021)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems. Theor. Comput. Sci. 803 (2020)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
New approximation algorithms for the minimum cycle cover problem. Theor. Comput. Sci. 793 (2019)
Wei Yu, Zhaohui Liu
Better approximability results for min-max tree/cycle/path cover problems. J. Comb. Optim. 37 (2) (2019)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. COCOON (2019)
Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
Approximation Algorithms for Some Minimum Postmen Cover Problems. COCOA (2019)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
New Approximation Algorithms for the Minimum Cycle Cover Problem. FAW (2018)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. AAIM (2018)
Wei Yu, Zhaohui Liu
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. COCOON (2017)
Xiaoguang Bao, Zhaohui Liu, Wei Yu, Ganggang Li
A note on approximation algorithms of the clustered traveling salesman problem. Inf. Process. Lett. 127 (2017)
Wei Yu, Zhaohui Liu
Improved approximation algorithms for some min-max and minimum cycle cover problems. Theor. Comput. Sci. 654 (2016)
Wei Yu, Zhaohui Liu
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. COCOON (2015)
Wei Yu, Zhaohui Liu, Xiaoguang Bao
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem. Eur. J. Oper. Res. 238 (3) (2014)
Wei Yu, Zhaohui Liu
Single-vehicle scheduling problems with release and service times on a line. Networks 57 (2) (2011)
Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan
Routing open shop and flow shop scheduling problems. Eur. J. Oper. Res. 213 (1) (2011)
Wei Yu, Zhaohui Liu
Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37 (2) (2009)