default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJian Guan 0007
Person information
- affiliation: Minjiang University, College of Mathematics and Data Science, Modern Educational Technology Center, Fuzhou, China
- affiliation: Hangzhou Dianzi University, School of Computer Science and Technology, China
Other persons with the same name
- Jian Guan — disambiguation page
- Jian Guan 0001
![[0000-0002-0945-1081]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0945-1081")
— Harbin Engineering University, College of Computer Science and Technology, GISP, China - Jian Guan 0002 — CoAI group, DCST, Institute for Artificial Intelligence, China (and 1 more)
- Jian Guan 0003 — Jilin University, College of Electronic Science and Engineering, Changchun, China
- Jian Guan 0004 — University of Nottingham, School of Computer Science and Information Technology, UK
- Jian Guan 0005 — Naval Aviation University, NAU, Marine Target Detection Research Group, Yantai, China (and 2 more)
- Jian Guan 0006 (aka: Jian (Jeff) Guan 0006) — University of Louisville, College of Business, Department of Computer Information Systems, KY, USA
- Jian Guan 0008 — Chinese Academy of Sciences, Institutes for Robotics and Intelligent Manufacturing, Key Laboratory of Opto-Electronic Information Processing, Shenyang, China (and 1 more)
- Jian Guan 0009 — JD Health International Inc., Beijing, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Jian Guan, Ming Fan, Tieyong Zeng, Lihua Li:
Learning Common and Task-Specific Radiomic Features via Graph Regularized NMF for the Joint Prediction of Multiple Clinical Indicators in Breast Cancer. IEEE J. Biomed. Health Informatics 27(10): 4792-4803 (2023)- 2020
- [j11]Geng Lin, Haiping Xu, Xiang Chen, Jian Guan:
An effective binary artificial bee colony algorithm for maximum set k-covering problem. Expert Syst. Appl. 161: 113717 (2020) - [j10]Hui-Bin Feng, Zhaocai Yu, Jian Guan, Geng Lin:
A Hybrid Spectrum Combinational Auction Mechanism Based on a Weighted Bipartite Graph for Energy Internet in Smart Cities. Wirel. Commun. Mob. Comput. 2020: 8829602:1-8829602:13 (2020)
2010 – 2019
- 2019
- [j9]Geng Lin, Jian Guan, Zuoyong Li, Hui-Bin Feng:
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert Syst. Appl. 135: 201-211 (2019) - [j8]Jian Guan, Geng Lin, Hui-Bin Feng:
Ant colony optimisation with local search for the bandwidth minimisation problem on graphs. Int. J. Intell. Inf. Database Syst. 12(1/2): 65-78 (2019) - 2018
- [j7]Jian Guan, Geng Lin, Hui-Bin Feng:
A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Appl. Soft Comput. 73: 230-241 (2018) - [j6]Jian Guan, Geng Lin, Hui-Bin Feng:
A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 98: 1-12 (2018) - [j5]Geng Lin, Jian Guan:
A hybrid binary particle swarm optimization for the obnoxious p-median problem. Inf. Sci. 425: 1-17 (2018) - [j4]Geng Lin, Jian Guan:
A Binary Particle Swarm Optimization for the Minimum Weight Dominating Set Problem. J. Comput. Sci. Technol. 33(2): 305-322 (2018) - [j3]Geng Lin, Jian Guan:
Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method. Knowl. Based Syst. 142: 95-107 (2018) - 2016
- [j2]Geng Lin, Jian Guan:
An Integrated Method Based on PSO and EDA for the Max-Cut Problem. Comput. Intell. Neurosci. 2016: 3420671:1-3420671:13 (2016) - [j1]Jian Guan, Geng Lin:
Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. Eur. J. Oper. Res. 248(3): 899-909 (2016)
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-15 20:39 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:
