default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiulan Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Xujin Chen
, Guoli Ding, Wenan Zang, Qiulan Zhao:
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49(1): 151-170 (2024)- [j17]Qiulan Zhao, Jinjiang Yuan:
Single-machine primary-secondary scheduling with total tardiness being the primary criterion. J. Sched. 27(3): 309-318 (2024) - 2022
- [j16]Qiulan Zhao, Hongbiao Cheng, Rui Cao:
Dynamics analysis for the Wadati-Konno-Ichikawa(II)-short pulse equation. Appl. Math. Lett. 129: 107941 (2022) - [j15]Xinyue Li, Guangfu Han, Qiulan Zhao:
Interactions of localized wave and dynamics analysis in generalized derivative nonlinear Schrödinger equation. Commun. Nonlinear Sci. Numer. Simul. 114: 106612 (2022) - 2021
- [j14]Qiulan Zhao, Jinjiang Yuan:
Scheduling to tradeoff between the number and the length of accepted jobs. Theor. Comput. Sci. 891: 24-34 (2021) - 2020
- [j13]Xinyue Li, Qiulan Zhao, Qianqian Yang:
Integrable asymmetric AKNS model with multi-component. Commun. Nonlinear Sci. Numer. Simul. 91: 105434 (2020) - [j12]Qiulan Zhao, Jinjiang Yuan:
Bicriteria scheduling of equal length jobs on uniform parallel machines. J. Comb. Optim. 39(3): 637-661 (2020) - [j11]Qiulan Zhao, Zhibin Chen, Jiajun Sang:
Co-density and fractional edge cover packing. J. Comb. Optim. 39(4): 955-987 (2020) - [j10]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors I: Structural description. J. Comb. Theory B 141: 264-294 (2020) - [j9]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory B 142: 244-275 (2020)
2010 – 2019
- 2019
- [j8]Yadong Zhong, Qiulan Zhao, Xinyue Li:
Explicit solutions to a coupled integrable lattice equation. Appl. Math. Lett. 98: 359-364 (2019) - [j7]Qianqian Yang, Qiulan Zhao, Xinyue Li:
Explicit Solutions and Conservation Laws for a New Integrable Lattice Hierarchy. Complex. 2019: 5984356:1-5984356:10 (2019) - [j6]Qiulan Zhao, Jinjiang Yuan:
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. Oper. Res. Lett. 47(6): 607-610 (2019) - [j5]Xujin Chen, Wenan Zang, Qiulan Zhao:
Densities, Matchings, and Fractional Edge-Colorings. SIAM J. Optim. 29(1): 240-261 (2019) - 2018
- [j4]Guoli Ding, Wenan Zang, Qiulan Zhao:
On box-perfect graphs. J. Comb. Theory B 128: 17-46 (2018) - 2017
- [b1]Qiulan Zhao:
Ranking tournaments with no errors. University of Hong Kong, Pokfulam, Hong Kong, 2017 - [j3]Qiulan Zhao, Jinjiang Yuan:
Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs. Asia Pac. J. Oper. Res. 34(5): 1750024:1-1750024:12 (2017) - 2016
- [j2]Qiulan Zhao, Lingfa Lu, Jinjiang Yuan:
Rescheduling with new orders and general maximum allowable time disruptions. 4OR 14(3): 261-280 (2016) - 2013
- [j1]Qiulan Zhao, Jinjiang Yuan:
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J. Sched. 16(3): 253-260 (2013)
Coauthor Index
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 2024-07-05 21:03 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:
