Zhaohui Liu 0001

dblp:05/5317-1 · DBLP profile ↗
← Back
7ranked-venue papers in the field
2as first author
2since 2021 · last 2022
0000-0003-1215-7622ORCID · conflict

Domains — venue-derived; a paper can count in several

Other / Interdisciplinary · 7 (2 first)
YearPublicationVenuePosition
2022 Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
Wei Yu 0011, Zhaohui Liu 0001
Inf. Process. Lett.2
2022 An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem
Yubai Zhang, Zhao Zhang 0002, Zhaohui Liu 0001, Qirong Chen
Inf. Process. Lett.3
2017 A note on approximation algorithms of the clustered traveling salesman problem
Xiaoguang Bao, Zhaohui Liu 0001, Wei Yu 0011, Ganggang Li
Inf. Process. Lett.2
2012 An improved approximation algorithm for the clustered traveling salesman problem
Xiaoguang Bao, Zhaohui Liu 0001
Inf. Process. Lett.2
2003 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
T. C. E. Cheng, Zhaohui Liu 0001
Inf. Process. Lett.2
2002 Scheduling with job release dates, delivery times and preemption penalties
Zhaohui Liu 0001, T. C. E. Cheng
Inf. Process. Lett.1
1999 Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines
Zhaohui Liu 0001, Wenci Yu, T. C. E. Cheng
Inf. Process. Lett.1