Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Jin 0005
Person information
- unicode name: 金燕
- affiliation: Huazhong University of Science & Technology, Wuhan, China
- affiliation (PhD 2015): University of Angers, France
Other persons with the same name
- Yan Jin — disambiguation page
- Yan Jin 0001
![[0000-0001-9392-5552]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9392-5552")
— University of Texas, MD Anderson Cancer Center, Houston, TX, USA (and 3 more) - Yan Jin 0002 — University of Nottingham, School of Computer Science, UK
- Yan Jin 0003 — University of Bremen, Center of Applied Space Technology and Microgravity, Germany
- Yan Jin 0004 — Nanjing University of Posts and Telecommunications, School of Geographic and Biologic Information, China (and 1 more)
- Yan Jin 0006 — Zhejiang University of Technology, College of Information Engineering, China
- Yan Jin 0007 — Chinese Academy of Chinese Medical Sciences (CACMS), National Resource Center for Chinese Materia Medica, China
- Yan Jin 0008 — University of Southern California, Dept. of Aerospace and Mechanical Engineering, Los Angeles, CA, USA
- Yan Jin 0009 — Queen's University Belfast, Belfast, UK
- Yan Jin 0010 — Yonsei University, Department of Human Environment & Design, Seoul, South Korea
- Yan Jin 0011 — The Third Xiangya Hospital of Central South University, Changsha, China
- Yan Jin 0012 — Guangxi University, Nanning, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems. Knowl. Based Syst. 260: 110144 (2023)- [i9]Jiongzhi Zheng, Mingming Jin, Yan Jin, Kun He:
Relaxed Graph Color Bound for the Maximum k-plex Problem. CoRR abs/2301.07300 (2023) - 2022
- [j20]Yan Jin, John H. Drake, Kun He, Una Benlic:
Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. Appl. Soft Comput. 131: 109758 (2022) - [j19]Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin:
An effective branch-and-bound algorithm for the maximum s-bundle problem. Eur. J. Oper. Res. 297(1): 27-39 (2022) - [j18]Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou:
On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187: 115915 (2022) - [j17]Yan Jin, Bowen Xiong, Kun He, Jin-Kao Hao, Chu-Min Li, Zhang-Hua Fu:
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. IEEE Trans. Computers 71(10): 2370-2380 (2022) - [c3]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI 2022: 1901-1907 - [i8]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR abs/2201.05544 (2022) - [i7]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR abs/2207.03876 (2022) - [i6]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR abs/2211.16011 (2022) - 2021
- [j16]Pengli Ji, Kun He, Zhengli Wang, Yan Jin, Jigang Wu:
A Quasi-Newton-based Floorplanner for fixed-outline floorplanning. Comput. Oper. Res. 129: 105225 (2021) - [j15]Yangming Zhou, Zhe Wang, Yan Jin, Zhang-Hua Fu:
Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs. Knowl. Based Syst. 211: 106562 (2021) - [c2]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. AAAI 2021: 12445-12452 - 2020
- [j14]Kun He, Huan Yang, Yan Jin, Qian Hu, Pengli Ji:
The Orthogonal Packing and Scheduling Problem: Model, Heuristic, and Benchmark. IEEE Trans. Syst. Man Cybern. Syst. 50(4): 1372-1383 (2020) - [c1]Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin:
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. AAAI 2020: 2442-2449 - [i5]Kun He, Min Zhang, Jianrong Zhou, Yan Jin, Chu-Min Li:
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. CoRR abs/2001.08540 (2020) - [i4]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. CoRR abs/2012.04461 (2020)
2010 – 2019
- 2019
- [j13]Yan Jin, Jin-Kao Hao:
Solving the Latin Square Completion Problem by Memetic Graph Coloring. IEEE Trans. Evol. Comput. 23(6): 1015-1028 (2019) - [i3]Yan Jin, John H. Drake, Una Benlic, Kun He:
Effective reinforcement learning based local search for the maximum k-plex problem. CoRR abs/1903.05537 (2019) - 2018
- [j12]Qinghua Wu, Qing Zhou, Yan Jin, Jin-Kao Hao:
Minimum sum coloring for large graphs with extraction and backward expansion search. Appl. Soft Comput. 62: 1056-1065 (2018) - [j11]Kun He, Mohammed Dosh, Yan Jin, Shenghao Zou:
Packing unequal circles into a square container based on the narrow action spaces. Sci. China Inf. Sci. 61(4): 048104:1-048104:3 (2018) - [j10]Zhengli Wang, Tian Xie, Kun He, Yan Jin:
考虑时间因素的0-1背包调度问题 (0-1 Knapsack Variant with Time Scheduling). 计算机科学 45(4): 53-59 (2018) - [j9]Qi Sun, Yan Jin, Kun He, Lingxuan Xu:
用于求解混合车辆路径问题的混合进化算法 (Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem). 计算机科学 45(4): 76-82 (2018) - 2017
- [j8]Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao:
Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47(3): 367-394 (2017) - [j7]Pengli Ji, Kun He, Yan Jin, Hongsheng Lan, Chumin Li:
An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Comput. Oper. Res. 86: 110-123 (2017) - 2016
- [j6]Yan Jin, Jin-Kao Hao:
Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. 352-353: 15-34 (2016) - 2015
- [b1]Yan Jin:
Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring. (Métaheuristiques hybrides pour la somme coloration et la coloration de bande passante). University of Angers, France, 2015 - [j5]Yan Jin, Jin-Kao Hao:
General swap-based multiple neighborhood tabu search for the maximum independent set problem. Eng. Appl. Artif. Intell. 37: 20-33 (2015) - [j4]Yan Jin, Jin-Kao Hao:
Effective Learning-Based Hybrid Search for Bandwidth Coloring. IEEE Trans. Syst. Man Cybern. Syst. 45(4): 624-635 (2015) - [i2]Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao:
Algorithms for the minimum sum coloring problem: a review. CoRR abs/1505.00449 (2015) - 2014
- [j3]Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez:
A memetic algorithm for the Minimum Sum Coloring Problem. Comput. Oper. Res. 43: 318-327 (2014) - 2013
- [j2]Kun He, Yan Jin, Wenqi Huang:
Heuristics for two-dimensional strip packing problem with 90° rotations. Expert Syst. Appl. 40(14): 5542-5550 (2013) - [i1]Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez:
A memetic algorithm for the minimum sum coloring problem. CoRR abs/1304.2641 (2013) - 2012
- [j1]Kun He, Wenqi Huang, Yan Jin:
An efficient deterministic heuristic for two-dimensional rectangular packing. Comput. Oper. Res. 39(7): 1355-1363 (2012)
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-04-21 17:10 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:
