Yan Jin

ORCID

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 29

Top Venues

University of Angers, France (PHD)

Education History

University of Angers, France

PHD

Publications

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 (2023)
Jiongzhi Zheng, Mingming Jin, Yan Jin, Kun He
Relaxed Graph Color Bound for the Maximum k-plex Problem. CoRR (2023)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR (2022)
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) (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR (2022)
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 (2022)
Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou
On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187 (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR (2022)
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)
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) (2022)
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)
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 (2021)
Pengli Ji, Kun He, Zhengli Wang, Yan Jin, Jigang Wu
A Quasi-Newton-based Floorplanner for fixed-outline floorplanning. Comput. Oper. Res. 129 (2021)
Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin
-Plexes with Worst-Case Time Guarantee. AAAI (2020)
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) (2020)
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 (2020)
Kun He, Min Zhang, Jianrong Zhou, Yan Jin, Chu-Min Li
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. CoRR (2020)
Yan Jin, Jin-Kao Hao
Solving the Latin Square Completion Problem by Memetic Graph Coloring. IEEE Trans. Evol. Comput. 23 (6) (2019)
Yan Jin, John H. Drake, Una Benlic, Kun He
Effective reinforcement learning based local search for the maximum k-plex problem. CoRR (2019)
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) (2018)
Qi Sun, Yan Jin, Kun He, Lingxuan Xu
用于求解混合车辆路径问题的混合进化算法 (Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem). 计算机科学 45 (4) (2018)
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 (2018)
Zhengli Wang, Tian Xie, Kun He, Yan Jin
考虑时间因素的0-1背包调度问题 (0-1 Knapsack Variant with Time Scheduling). 计算机科学 45 (4) (2018)
Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao
Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47 (3) (2017)
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 (2017)
Yan Jin, Jin-Kao Hao
Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. (2016)
Yan Jin, Jin-Kao Hao
General swap-based multiple neighborhood tabu search for the maximum independent set problem. Eng. Appl. Artif. Intell. 37 (2015)
Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao
Algorithms for the minimum sum coloring problem: a review. CoRR (2015)
Yan Jin, Jin-Kao Hao
Effective Learning-Based Hybrid Search for Bandwidth Coloring. IEEE Trans. Syst. Man Cybern. Syst. 45 (4) (2015)
Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez
A memetic algorithm for the Minimum Sum Coloring Problem. Comput. Oper. Res. 43 (2014)
Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez
A memetic algorithm for the minimum sum coloring problem CoRR (2013)
Kun He, Yan Jin, Wenqi Huang
Heuristics for two-dimensional strip packing problem with 90° rotations. Expert Syst. Appl. 40 (14) (2013)
Kun He, Wenqi Huang, Yan Jin
An efficient deterministic heuristic for two-dimensional rectangular packing. Comput. Oper. Res. 39 (7) (2012)

Yan Jin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yan Jin