Wei Yu

According to our database, Wei Yu authored at least 20 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A local search algorithm for the k-path partition problem.

Shiming Li, Wei Yu, Zhaohui Liu

Optim. Lett., January, 2024

2023

Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover.

Wei Yu

Math. Methods Oper. Res., February, 2023

Approximation algorithms for some min-max and minimum stacker crane cover problems.

Yuhui Sun, Wei Yu, Zhaohui Liu

J. Comb. Optim., 2023

2022

Approximation algorithms for the k-depots Hamiltonian path problem.

Yichen Yang, Zhaohui Liu, Wei Yu

Optim. Lett., 2022

Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

J. Comb. Optim., 2022

Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints.

Wei Yu, Zhaohui Liu

Inf. Process. Lett., 2022

Approximation algorithms for some Minimum Postmen Cover Problems.

Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong

Discret. Appl. Math., 2022

2021

Approximation algorithms for some min-max postmen cover problems.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

Ann. Oper. Res., 2021

2020

New LP relaxations for Minimum Cycle/Path/Tree Cover Problems.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

Theor. Comput. Sci., 2020

2019

New approximation algorithms for the minimum cycle cover problem.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

Theor. Comput. Sci., 2019

Better approximability results for min-max tree/cycle/path cover problems.

Wei Yu, Zhaohui Liu

J. Comb. Optim., 2019

Distance Constrained Vehicle Routing Problem to Minimize the Total Cost.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2017

A note on approximation algorithms of the clustered traveling salesman problem.

Xiaoguang Bao, Zhaohui Liu, Wei Yu, Ganggang Li

Inf. Process. Lett., 2017

Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems.

Wei Yu, Zhaohui Liu

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Improved approximation algorithms for some min-max and minimum cycle cover problems.

Wei Yu, Zhaohui Liu

Theor. Comput. Sci., 2016

2015

Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems.

Wei Yu, Zhaohui Liu

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem.

Wei Yu, Zhaohui Liu, Xiaoguang Bao

Eur. J. Oper. Res., 2014

2011

Single-vehicle scheduling problems with release and service times on a line.

Wei Yu, Zhaohui Liu

Networks, 2011

Routing open shop and flow shop scheduling problems.

Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan

Eur. J. Oper. Res., 2011

2009

Vehicle routing problems on a line-shaped network with release time constraints.

Wei Yu, Zhaohui Liu

Oper. Res. Lett., 2009