default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMin Lin 0003
Person information
- affiliation: Fujian Agriculture and Forestry University, Fuzhou, China
Other persons with the same name
- Min Lin — disambiguation page
- Min Lin 0001
![[0000-0002-0296-436X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0296-436X")
— Nanjing University of Posts and Telecommunications, College of Telecommunications and Information Engineering, Nanjing, China - Min Lin 0002 — Shanghai University, Advanced SoC and IoT Technology Laboratory, Shanghai, China (and 1 more)
- Min Lin 0004 — University of Wyoming, Laramie, WY, USA
- Min Lin 0005 — Chinese Academy of Sciences, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Min Lin, Yuhang Yang, Yiwen Zhong, Juan Lin:
A real-coded chicken swarm optimisation algorithm for solving travelling salesman problem. Int. J. Comput. Sci. Math. 17(2): 166-181 (2023)- 2021
- [j7]Min Lin, Yiwen Zhong, Riqing Chen:
Graphic process units-based chicken swarm optimization algorithm for function optimization problems. Concurr. Comput. Pract. Exp. 33(8) (2021)
2010 – 2019
- 2019
- [j6]Lijin Wang, Rongying Cai, Min Lin, Yiwen Zhong:
Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem. IEEE Access 7: 144366-144380 (2019) - [j5]Yiwen Zhong, Lijin Wang, Min Lin, Hui Zhang:
Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem. Swarm Evol. Comput. 48: 134-144 (2019) - 2018
- [j4]Min Lin, Yiwen Zhong, Juan Lin, Xiaoyu Lin:
Enhanced chicken swarm optimisation for function optimisation problem. Int. J. Wirel. Mob. Comput. 15(3): 258-269 (2018) - 2016
- [j3]Changying Wang, Min Lin, Yiwen Zhong, Hui Zhang:
Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem. Int. J. Intell. Syst. Technol. Appl. 15(1): 74-94 (2016) - [j2]Changying Wang, Juan Lin, Min Lin, Yiwen Zhong:
Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem. Int. J. Wirel. Mob. Comput. 10(2): 166-173 (2016) - 2015
- [j1]Changying Wang, Min Lin, Yiwen Zhong, Hui Zhang:
Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling. Int. J. Comput. Sci. Math. 6(4): 336-353 (2015)
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-12-12 21:57 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:
