Zhaohui Liu

According to our database, Zhaohui Liu authored at least 43 papers between 1999 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

Heuristics for Finding Sparse Solutions of Linear Inequalities.

Yichen Yang, Zhaohui Liu

Asia Pac. J. 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

The price of fairness for a two-agent scheduling game minimizing total completion time.

Yubai Zhang, Zhao Zhang, Zhaohui Liu

J. Comb. Optim., 2022

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

Wei Yu, Zhaohui Liu, Xiaoguang Bao

J. Comb. Optim., 2022

An asymptotically tight online algorithm for <i>m</i>-Steiner Traveling Salesman Problem.

Yubai Zhang, Zhao Zhang, Zhaohui Liu, Qirong Chen

Inf. Process. Lett., 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

Approximating the multiple-depot multiple-terminal Hamiltonian path problem.

Yichen Yang, Zhaohui Liu

Discret. 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

Semi-online scheduling with bounded job sizes on two uniform machines.

Qian Cao, 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

2013

Single Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network.

Leiyang Wang, Zhaohui Liu

Asia Pac. J. Oper. Res., 2013

2012

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle.

Xiaoguang Bao, Zhaohui Liu

Theor. Comput. Sci., 2012

An improved approximation algorithm for the clustered traveling salesman problem.

Xiaoguang Bao, Zhaohui Liu

Inf. Process. Lett., 2012

2011

Semi-online scheduling with known partial information about job sizes on two identical machines.

Qian Cao, Zhaohui Liu, T. C. Edwin Cheng

Theor. Comput. Sci., 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

2010

Online scheduling with reassignment on two uniform machines.

Qian Cao, Zhaohui Liu

Theor. Comput. Sci., 2010

Semi-online scheduling with known maximum job size on two uniform machines.

Qian Cao, Zhaohui Liu

J. Comb. Optim., 2010

2009

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

Wei Yu, Zhaohui Liu

Oper. Res. Lett., 2009

2006

Single machine batch scheduling problem with family setup times and release dates to minimize makespan.

Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng

J. Sched., 2006

2005

Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.

Zhaohui Liu, T. C. Edwin Cheng

Theor. Comput. Sci., 2005

Single machine scheduling to minimize total weighted tardiness.

T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu

Eur. J. Oper. Res., 2005

2004

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.

Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng

Theor. Comput. Sci., 2004

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties.

Zhaohui Liu, T. C. Edwin Cheng

J. Sched., 2004

2003

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.

C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu

Oper. Res. Lett., 2003

On scheduling an unbounded batch machine.

Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng

Oper. Res. Lett., 2003

Approximability of two-machine no-wait flowshop scheduling with availability constraints.

T. C. Edwin Cheng, Zhaohui Liu

Oper. Res. Lett., 2003

3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints.

T. C. Edwin Cheng, Zhaohui Liu

Inf. Process. Lett., 2003

2002

Scheduling with job release dates, delivery times and preemption penalties.

Zhaohui Liu, T. C. Edwin Cheng

Inf. Process. Lett., 2002

2000

Scheduling one batch processor subject to job release dates.

Zhaohui Liu, Wenci Yu

Discret. Appl. Math., 2000

1999

Minimizing the Number of Late Jobs under the Group Technology Assumption.

Zhaohui Liu, Wenci Yu

J. Comb. Optim., 1999

Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines.

Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng

Inf. Process. Lett., 1999