Zhaohui Liu

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 19

Top Topics

Traveling Salesman

Routing Problem

Approximation Algorithms

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Inf. Process. Lett.

Publications

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)
Qian Cao, Zhaohui Liu
Semi-online scheduling with bounded job sizes on two uniform machines. Theor. Comput. Sci. 652 (2016)
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)
Leiyang Wang, Zhaohui Liu
Single Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network. Asia Pac. J. Oper. Res. 30 (1) (2013)
Xiaoguang Bao, Zhaohui Liu
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor. Comput. Sci. 434 (2012)
Xiaoguang Bao, Zhaohui Liu
An improved approximation algorithm for the clustered traveling salesman problem. Inf. Process. Lett. 112 (23) (2012)
Wei Yu, Zhaohui Liu
Single-vehicle scheduling problems with release and service times on a line. Networks 57 (2) (2011)
Qian Cao, Zhaohui Liu, T. C. Edwin Cheng
Semi-online scheduling with known partial information about job sizes on two identical machines. Theor. Comput. Sci. 412 (29) (2011)
Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan
Routing open shop and flow shop scheduling problems. Eur. J. Oper. Res. 213 (1) (2011)
Qian Cao, Zhaohui Liu
Online scheduling with reassignment on two uniform machines. Theor. Comput. Sci. 411 (31-33) (2010)
Qian Cao, Zhaohui Liu
Semi-online scheduling with known maximum job size on two uniform machines. J. Comb. Optim. 20 (4) (2010)
Wei Yu, Zhaohui Liu
Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37 (2) (2009)
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
Single machine batch scheduling problem with family setup times and release dates to minimize makespan. J. Sched. 9 (6) (2006)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu
Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165 (2) (2005)
Zhaohui Liu, T. C. Edwin Cheng
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. Theor. Comput. Sci. 347 (1-2) (2005)
Zhaohui Liu, T. C. Edwin Cheng
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. J. Sched. 7 (4) (2004)
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theor. Comput. Sci. 320 (2-3) (2004)
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper. Res. Lett. 31 (3) (2003)
Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng
On scheduling an unbounded batch machine. Oper. Res. Lett. 31 (1) (2003)
T. C. Edwin Cheng, Zhaohui Liu
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. Inf. Process. Lett. 88 (4) (2003)
T. C. Edwin Cheng, Zhaohui Liu
Approximability of two-machine no-wait flowshop scheduling with availability constraints. Oper. Res. Lett. 31 (3) (2003)
Zhaohui Liu, T. C. Edwin Cheng
Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82 (2) (2002)
Zhaohui Liu, Wenci Yu
Scheduling one batch processor subject to job release dates. Discret. Appl. Math. 105 (1-3) (2000)
Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng
Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. Inf. Process. Lett. 69 (6) (1999)
Zhaohui Liu, Wenci Yu
Minimizing the Number of Late Jobs under the Group Technology Assumption. J. Comb. Optim. 3 (1) (1999)