default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhaohui Liu 0001
Person information
- affiliation: East China University of Science and Technology, Department of Mathematics, Shanghai, China
Other persons with the same name
- Zhaohui Liu (aka: Zhao-hui Liu) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j50]Minqin Liu, Wei Yu
, Zhaohui Liu, Xinmeng Guo:
Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints. J. Comb. Optim. 49(3): 39 (2025)- 2024
- [j49]Liting Huang, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. Algorithmica 86(4): 1135-1162 (2024) - [j48]Shiming Li, Wei Yu, Zhaohui Liu:
Improved approximation algorithms for the k-path partition problem. J. Glob. Optim. 90(4): 983-1006 (2024) - [j47]Shiming Li, Wei Yu, Zhaohui Liu:
A local search algorithm for the k-path partition problem. Optim. Lett. 18(1): 279-290 (2024) - [c11]Yaqi Li, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem. AAIM (1) 2024: 170-181 - [c10]Xinmeng Guo, Wei Yu, Zhaohui Liu:
Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. COCOON (1) 2024: 116-127 - 2023
- [j46]Yichen Yang, Zhaohui Liu:
Heuristics for Finding Sparse Solutions of Linear Inequalities. Asia Pac. J. Oper. Res. 40(1): 2240005:1-2240005:20 (2023) - [j45]Yuhui Sun, Wei Yu, Zhaohui Liu:
Approximation algorithms for some min-max and minimum stacker crane cover problems. J. Comb. Optim. 45(1): 18 (2023) - [c9]Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo:
Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints. COCOA (1) 2023: 129-140 - 2022
- [j44]Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation algorithms for some Minimum Postmen Cover Problems. Discret. Appl. Math. 319: 382-393 (2022) - [j43]Yubai Zhang, Zhao Zhang, Zhaohui Liu, Qirong Chen:
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem. Inf. Process. Lett. 174: 106177 (2022) - [j42]Wei Yu, Zhaohui Liu:
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints. Inf. Process. Lett. 178: 106299 (2022) - [j41]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. J. Comb. Optim. 43(5): 1405-1422 (2022) - [j40]Yubai Zhang, Zhao Zhang, Zhaohui Liu:
The price of fairness for a two-agent scheduling game minimizing total completion time. J. Comb. Optim. 44(3): 2104-2122 (2022) - [j39]Yichen Yang, Zhaohui Liu, Wei Yu:
Approximation algorithms for the k-depots Hamiltonian path problem. Optim. Lett. 16(4): 1215-1234 (2022) - [c8]Liting Huang, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. COCOON 2022: 36-48 - 2021
- [j38]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300(1): 267-287 (2021) - [c7]Yuhui Sun, Wei Yu, Zhaohui Liu:
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems. COCOA 2021: 400-415 - 2020
- [j37]Zhaohui Liu, Jiyuan Zhan:
Online fractional hierarchical scheduling on uniformly related machines. Comput. Oper. Res. 113 (2020) - [j36]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems. Theor. Comput. Sci. 803: 71-81 (2020)
2010 – 2019
- 2019
- [j35]Yichen Yang, Zhaohui Liu:
Approximating the multiple-depot multiple-terminal Hamiltonian path problem. Discret. Optim. 34 (2019) - [j34]Wei Yu, Zhaohui Liu:
Better approximability results for min-max tree/cycle/path cover problems. J. Comb. Optim. 37(2): 563-578 (2019) - [j33]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New approximation algorithms for the minimum cycle cover problem. Theor. Comput. Sci. 793: 44-58 (2019) - [c6]Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation Algorithms for Some Minimum Postmen Cover Problems. COCOA 2019: 375-386 - [c5]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. COCOON 2019: 639-650 - 2018
- [c4]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. AAIM 2018: 221-232 - [c3]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New Approximation Algorithms for the Minimum Cycle Cover Problem. FAW 2018: 81-95 - 2017
- [j32]Xiaoguang Bao, Zhaohui Liu, Wei Yu, Ganggang Li:
A note on approximation algorithms of the clustered traveling salesman problem. Inf. Process. Lett. 127: 54-57 (2017) - [c2]Wei Yu, Zhaohui Liu:
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. COCOON 2017: 542-554 - 2016
- [j31]Zhaohui Liu, Wen-Chiung Lee, Jen-Ya Wang:
Resource consumption minimization with a constraint of maximum tardiness on parallel machines. Comput. Ind. Eng. 97: 191-201 (2016) - [j30]Xinrong Lu, Zhaohui Liu:
An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies. J. Syst. Sci. Complex. 29(6): 1650-1657 (2016) - [j29]Qian Cao, Zhaohui Liu:
Semi-online scheduling with bounded job sizes on two uniform machines. Theor. Comput. Sci. 652: 1-17 (2016) - [j28]Wei Yu, Zhaohui Liu:
Improved approximation algorithms for some min-max and minimum cycle cover problems. Theor. Comput. Sci. 654: 45-58 (2016) - 2015
- [j27]Xinrong Lu, Zhaohui Liu:
Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes. Asia Pac. J. Oper. Res. 32(5): 1550032:1-1550032:31 (2015) - [j26]Jia Xu, Zhaohui Liu:
Online scheduling with equal processing times and machine eligibility constraints. Theor. Comput. Sci. 572: 58-65 (2015) - [c1]Wei Yu, Zhaohui Liu:
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. COCOON 2015: 147-158 - 2014
- [j25]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem. Eur. J. Oper. Res. 238(3): 735-740 (2014) - 2013
- [j24]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) - [j23]Shuyu Zhou, Zhaohui Liu:
A theoretical development for the total tardiness problem and its application in branch and bound algorithms. Comput. Oper. Res. 40(1): 248-252 (2013) - [j22]Xinrong Lu, Zhaohui Liu:
Semi-online scheduling problems on two uniform machines under a grade of service provision. Theor. Comput. Sci. 489-490: 58-66 (2013) - 2012
- [j21]Xiaoguang Bao, Zhaohui Liu:
An improved approximation algorithm for the clustered traveling salesman problem. Inf. Process. Lett. 112(23): 908-910 (2012) - [j20]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: 1-10 (2012) - 2011
- [j19]Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan:
Routing open shop and flow shop scheduling problems. Eur. J. Oper. Res. 213(1): 24-36 (2011) - [j18]Wei Yu, Zhaohui Liu:
Single-vehicle scheduling problems with release and service times on a line. Networks 57(2): 128-134 (2011) - [j17]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): 3731-3737 (2011) - 2010
- [j16]Qian Cao, Zhaohui Liu:
Semi-online scheduling with known maximum job size on two uniform machines. J. Comb. Optim. 20(4): 369-384 (2010) - [j15]Qian Cao, Zhaohui Liu:
Online scheduling with reassignment on two uniform machines. Theor. Comput. Sci. 411(31-33): 2890-2898 (2010)
2000 – 2009
- 2009
- [j14]Wei Yu, Zhaohui Liu:
Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37(2): 85-88 (2009) - 2006
- [j13]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): 499-513 (2006) - 2005
- [j12]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): 423-443 (2005) - [j11]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): 288-298 (2005) - 2004
- [j10]Zhaohui Liu, T. C. Edwin Cheng:
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. J. Sched. 7(4): 313-327 (2004) - [j9]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): 199-212 (2004) - 2003
- [j8]T. C. Edwin Cheng, Zhaohui Liu:
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. Inf. Process. Lett. 88(4): 161-165 (2003) - [j7]Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng:
On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003) - [j6]T. C. Edwin Cheng, Zhaohui Liu:
Approximability of two-machine no-wait flowshop scheduling with availability constraints. Oper. Res. Lett. 31(3): 319-322 (2003) - [j5]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): 323-326 (2003) - 2002
- [j4]Zhaohui Liu, T. C. Edwin Cheng:
Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82(2): 107-111 (2002) - 2000
- [j3]Zhaohui Liu, Wenci Yu:
Scheduling one batch processor subject to job release dates. Discret. Appl. Math. 105(1-3): 129-136 (2000)
1990 – 1999
- 1999
- [j2]Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng:
Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. Inf. Process. Lett. 69(6): 275-281 (1999) - [j1]Zhaohui Liu, Wenci Yu:
Minimizing the Number of Late Jobs under the Group Technology Assumption. J. Comb. Optim. 3(1): 5-15 (1999)
Coauthor Index
aka: T. C. Edwin Cheng
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
