default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaoguang Bao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Zhaocai Wang, Nannan Xu, Xiaoguang Bao, Junhao Wu, Xuefei Cui:
Spatio-temporal deep learning model for accurate streamflow prediction with multi-source data fusion. Environ. Model. Softw. 178: 106091 (2024)- [j16]Zhaocai Wang, Haifeng Zhao, Xiaoguang Bao, Tunhua Wu:
Multi-objective optimal allocation of water resources based on improved marine predator algorithm and entropy weighting method. Earth Sci. Informatics 17(2): 1483-1499 (2024) - [j15]Xiaoguang Bao, Xinhao Ni:
Approximation algorithms for two clustered arc routing problems. J. Comb. Optim. 47(5): 88 (2024) - 2023
- [j14]Zhaocai Wang
, Kun Liang, Xiaoguang Bao, Tunhua Wu:
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm. Quantum Inf. Process. 22(7): 271 (2023) - 2022
- [j13]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) - [j12]Xiaoguang Bao, Lei Xu, Wei Yu, Wei Song:
Approximation algorithms for the min-max clustered k-traveling salesmen problems. Theor. Comput. Sci. 933: 60-66 (2022) - 2021
- [j11]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300(1): 267-287 (2021) - [j10]Zhaocai Wang, Xiaoguang Bao, Tunhua Wu:
A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing. Comput. Intell. Neurosci. 2021: 8814947:1-8814947:13 (2021) - [j9]Zhaocai Wang, Dangwei Wang, Xiaoguang Bao, Tunhua Wu:
A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity. J. Intell. Fuzzy Syst. 40(3): 3957-3967 (2021) - 2020
- [j8]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
- [j7]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New approximation algorithms for the minimum cycle cover problem. Theor. Comput. Sci. 793: 44-58 (2019) - [c3]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. COCOON 2019: 639-650 - 2018
- [c2]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. AAIM 2018: 221-232 - [c1]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New Approximation Algorithms for the Minimum Cycle Cover Problem. FAW 2018: 81-95 - 2017
- [j6]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) - 2016
- [j5]Yunfei Zhou, Xiaoguang Bao, Weston Thatcher Borden:
Nucleus-independent chemical shift analysis of the electronic states of the (CO)4, (CS)4, and (CSe)4 molecules. J. Comput. Chem. 37(1): 46-48 (2016) - 2014
- [j4]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) - 2012
- [j3]Xiaoguang Bao, Zhaohui Liu:
An improved approximation algorithm for the clustered traveling salesman problem. Inf. Process. Lett. 112(23): 908-910 (2012) - [j2]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)
2000 – 2009
- 2008
- [j1]Guoming Liang, Xiaoguang Bao, Jiande Gu:
The possibility of the decomposition of 2'-deoxyribose moiety of thymidine induced by the low energy electron attachment. J. Comput. Chem. 29(16): 2648-2655 (2008)
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-11-14 00:49 CET 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:
