Zhaohui Liu

65 papers C 3Misc 5Journal 52Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
An Improved Approximation Algorithm for the Minimum k-Star Partition Problem.
COCOON (1)
Tong Xu, Wei Yu, Zhaohui Liu
2025 J jnl
Approximating Graphic Min-Max and Minimum Cycle/Path/Tree Cover Problems.
Discret. Appl. Math.
Wei Yu, Zhaohui Liu
2025 J jnl
Approximating the maximum weight cycle/path partition in graphs with weights one and two.
J. Comb. Optim.
Xinmeng Guo, Wei Yu, Zhaohui Liu
2025 J jnl
Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints.
J. Comb. Optim.
Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo
2024 J jnl
A local search algorithm for the k-path partition problem.
Optim. Lett.
Shiming Li, Wei Yu, Zhaohui Liu
2024 — conf
Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two.
COCOON (1)
Xinmeng Guo, Wei Yu, Zhaohui Liu
2024 — conf
Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems.
COCOA (1)
Jiafeng Xiong, Zhaohui Liu, Wei Yu
2024 J jnl
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.
Algorithmica
Liting Huang, Wei Yu, Zhaohui Liu
2024 — conf
Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
AAIM (1)
Yaqi Li, Wei Yu, Zhaohui Liu
2024 J jnl
Improved approximation algorithms for the k-path partition problem.
J. Glob. Optim.
Shiming Li, Wei Yu, Zhaohui Liu
2023 J jnl
Approximation algorithms for some min-max and minimum stacker crane cover problems.
J. Comb. Optim.
Yuhui Sun, Wei Yu, Zhaohui Liu
2023 — conf
Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints.
COCOA (1)
Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo
2023 J jnl
Heuristics for Finding Sparse Solutions of Linear Inequalities.
Asia Pac. J. Oper. Res.
Yichen Yang, Zhaohui Liu
2022 J jnl
An asymptotically tight online algorithm for
Inf. Process. Lett.
Yubai Zhang, Zhao Zhang, Zhaohui Liu, Qirong Chen
2022 Misc conf
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.
COCOON
Liting Huang, Wei Yu, Zhaohui Liu
2022 J jnl
Approximation algorithms for some Minimum Postmen Cover Problems.
Discret. Appl. Math.
Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
2022 J jnl
Approximation algorithms for the k-depots Hamiltonian path problem.
Optim. Lett.
Yichen Yang, Zhaohui Liu, Wei Yu
2022 J jnl
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints.
Inf. Process. Lett.
Wei Yu, Zhaohui Liu
2022 J jnl
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity.
J. Comb. Optim.
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2022 J jnl
The price of fairness for a two-agent scheduling game minimizing total completion time.
J. Comb. Optim.
Yubai Zhang, Zhao Zhang, Zhaohui Liu
2021 C conf
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems.
COCOA
Yuhui Sun, Wei Yu, Zhaohui Liu
2021 J jnl
Approximation algorithms for some min-max postmen cover problems.
Ann. Oper. Res.
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2020 J jnl
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems.
Theor. Comput. Sci.
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2020 J jnl
Online fractional hierarchical scheduling on uniformly related machines.
Comput. Oper. Res.
Zhaohui Liu, Jiyuan Zhan
2019 J jnl
Approximating the multiple-depot multiple-terminal Hamiltonian path problem.
Discret. Optim.
Yichen Yang, Zhaohui Liu
2019 C conf
Approximation Algorithms for Some Minimum Postmen Cover Problems.
COCOA
Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
2019 J jnl
Better approximability results for min-max tree/cycle/path cover problems.
J. Comb. Optim.
Wei Yu, Zhaohui Liu
2019 Misc conf
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost.
COCOON
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2019 J jnl
New approximation algorithms for the minimum cycle cover problem.
Theor. Comput. Sci.
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2018 Misc conf
New Approximation Algorithms for the Minimum Cycle Cover Problem.
FAW
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2018 C conf
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.
AAIM
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2017 J jnl
A note on approximation algorithms of the clustered traveling salesman problem.
Inf. Process. Lett.
Xiaoguang Bao, Zhaohui Liu, Wei Yu, Ganggang Li
2017 Misc conf
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems.
COCOON
Wei Yu, Zhaohui Liu
2016 J jnl
An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies.
J. Syst. Sci. Complex.
Xinrong Lu, Zhaohui Liu
2016 J jnl
Improved approximation algorithms for some min-max and minimum cycle cover problems.
Theor. Comput. Sci.
Wei Yu, Zhaohui Liu
2016 J jnl
Resource consumption minimization with a constraint of maximum tardiness on parallel machines.
Comput. Ind. Eng.
Zhaohui Liu, Wen-Chiung Lee, Jen-Ya Wang
2016 J jnl
Semi-online scheduling with bounded job sizes on two uniform machines.
Theor. Comput. Sci.
Qian Cao, Zhaohui Liu
2015 Misc conf
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems.
COCOON
Wei Yu, Zhaohui Liu
2015 J jnl
Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes.
Asia Pac. J. Oper. Res.
Xinrong Lu, Zhaohui Liu
2015 J jnl
Online scheduling with equal processing times and machine eligibility constraints.
Theor. Comput. Sci.
Jia Xu, Zhaohui Liu
2014 J jnl
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem.
Eur. J. Oper. Res.
Wei Yu, Zhaohui Liu, Xiaoguang Bao
2013 J jnl
A theoretical development for the total tardiness problem and its application in branch and bound algorithms.
Comput. Oper. Res.
Shuyu Zhou, Zhaohui Liu
2013 J jnl
Semi-online scheduling problems on two uniform machines under a grade of service provision.
Theor. Comput. Sci.
Xinrong Lu, Zhaohui Liu
2013 J jnl
Single Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network.
Asia Pac. J. Oper. Res.
Leiyang Wang, Zhaohui Liu
2012 J jnl
An improved approximation algorithm for the clustered traveling salesman problem.
Inf. Process. Lett.
Xiaoguang Bao, Zhaohui Liu
2012 J jnl
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle.
Theor. Comput. Sci.
Xiaoguang Bao, Zhaohui Liu
2011 J jnl
Routing open shop and flow shop scheduling problems.
Eur. J. Oper. Res.
Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan
2011 J jnl
Semi-online scheduling with known partial information about job sizes on two identical machines.
Theor. Comput. Sci.
Qian Cao, Zhaohui Liu, T. C. Edwin Cheng
2011 J jnl
Single-vehicle scheduling problems with release and service times on a line.
Networks
Wei Yu, Zhaohui Liu
2010 J jnl
Online scheduling with reassignment on two uniform machines.
Theor. Comput. Sci.
Qian Cao, Zhaohui Liu
2010 J jnl
Semi-online scheduling with known maximum job size on two uniform machines.
J. Comb. Optim.
Qian Cao, Zhaohui Liu
2009 J jnl
Vehicle routing problems on a line-shaped network with release time constraints.
Oper. Res. Lett.
Wei Yu, Zhaohui Liu
2006 J jnl
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2005 J jnl
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.
Theor. Comput. Sci.
Zhaohui Liu, T. C. Edwin Cheng
2005 J jnl
Single machine scheduling to minimize total weighted tardiness.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu
2004 J jnl
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties.
J. Sched.
Zhaohui Liu, T. C. Edwin Cheng
2004 J jnl
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2003 J jnl
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints.
Inf. Process. Lett.
T. C. Edwin Cheng, Zhaohui Liu
2003 J jnl
Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Oper. Res. Lett.
T. C. Edwin Cheng, Zhaohui Liu
2003 J jnl
On scheduling an unbounded batch machine.
Oper. Res. Lett.
Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng
2003 J jnl
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.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu
2002 J jnl
Scheduling with job release dates, delivery times and preemption penalties.
Inf. Process. Lett.
Zhaohui Liu, T. C. Edwin Cheng
2000 J jnl
Scheduling one batch processor subject to job release dates.
Discret. Appl. Math.
Zhaohui Liu, Wenci Yu
1999 J jnl
Minimizing the Number of Late Jobs under the Group Technology Assumption.
J. Comb. Optim.
Zhaohui Liu, Wenci Yu
1999 J jnl
Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines.
Inf. Process. Lett.
Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng