An efficient deterministic heuristic for two-dimensional rectangular packing. - Kun He 001; Wenqi Huang 001; Yan Jin 005 (Comput. Oper. Res., 2012)

Heuristics for two-dimensional strip packing problem with 90° rotations. - Kun He 001; Yan Jin 005; Wenqi Huang 001 (Expert Syst. Appl., 2013)

A memetic algorithm for the Minimum Sum Coloring Problem. - Yan Jin 005; Jin-Kao Hao; Jean-Philippe Hamiez (Comput. Oper. Res., 2014)

General swap-based multiple neighborhood tabu search for the maximum independent set problem. - Yan Jin 005; Jin-Kao Hao (Eng. Appl. Artif. Intell., 2015)

Effective Learning-Based Hybrid Search for Bandwidth Coloring. - Yan Jin 005; Jin-Kao Hao (IEEE Trans. Syst. Man Cybern. Syst., 2015)

Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring. (Métaheuristiques hybrides pour la somme coloration et la coloration de bande passante). - Yan Jin 005 (2015)

Hybrid evolutionary search for the minimum sum coloring problem of graphs. - Yan Jin 005; Jin-Kao Hao (Inf. Sci., 2016)

Algorithms for the minimum sum coloring problem: a review. - Yan Jin 005; Jean-Philippe Hamiez; Jin-Kao Hao (Artif. Intell. Rev., 2017)

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. - Pengli Ji; Kun He 001; Yan Jin 005; Hongsheng Lan; Chumin Li 001 (Comput. Oper. Res., 2017)

Minimum sum coloring for large graphs with extraction and backward expansion search. - Qinghua Wu 002; Qing Zhou; Yan Jin 005; Jin-Kao Hao (Appl. Soft Comput., 2018)

Packing unequal circles into a square container based on the narrow action spaces. - Kun He 001; Mohammed Dosh; Yan Jin 005; Shenghao Zou (Sci. China Inf. Sci., 2018)

用于求解混合车辆路径问题的混合进化算法 (Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem). - Qi Sun; Yan Jin 005; Kun He 001; Lingxuan Xu (计算机科学, 2018)

考虑时间因素的0-1背包调度问题 (0-1 Knapsack Variant with Time Scheduling). - Zhengli Wang; Tian Xie; Kun He 001; Yan Jin 005 (计算机科学, 2018)

Effective reinforcement learning based local search for the maximum k-plex problem. - Yan Jin 005; John H. Drake; Una Benlic; Kun He 001 (CoRR, 2019)

Solving the Latin Square Completion Problem by Memetic Graph Coloring. - Yan Jin 005; Jin-Kao Hao (IEEE Trans. Evol. Comput., 2019)

Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. - Yi Zhou 016; Jingwei Xu; Zhenyu Guo; Mingyu Xiao 001; Yan Jin 005 (AAAI, 2020)

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. - Kun He 001; Min Zhang; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (CoRR, 2020)

The Orthogonal Packing and Scheduling Problem: Model, Heuristic, and Benchmark. - Kun He 001; Huan Yang; Yan Jin 005; Qian Hu; Pengli Ji (IEEE Trans. Syst. Man Cybern. Syst., 2020)

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (AAAI, 2021)

A Quasi-Newton-based Floorplanner for fixed-outline floorplanning. - Pengli Ji; Kun He 001; Zhengli Wang; Yan Jin 005; Jigang Wu (Comput. Oper. Res., 2021)

Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs. - Yangming Zhou; Zhe Wang 002; Yan Jin 005; Zhang-Hua Fu (Knowl. Based Syst., 2021)

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (IJCAI, 2022)

Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. - Yan Jin 005; John H. Drake; Kun He 001; Una Benlic (Appl. Soft Comput., 2022)

Incorporating Multi-armed Bandit with Local Search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (CoRR, 2022)

Multi-Agent Reinforcement Learning with Shared Resources for Inventory Management. - Yuandong Ding; Mingxiao Feng; Guozi Liu; Wei Jiang 024; Chuheng Zhang; Li Zhao 007; Lei Song 001; Houqiang Li; Yan Jin 005; Jiang Bian 002 (CoRR, 2022)

An effective branch-and-bound algorithm for the maximum s-bundle problem. - Yi Zhou 016; Weibo Lin; Jin-Kao Hao; Mingyu Xiao 001; Yan Jin 005 (Eur. J. Oper. Res., 2022)

On fast enumeration of maximal cliques in large graphs. - Yan Jin 005; Bowen Xiong; Kun He 001; Yangming Zhou; Yi Zhou 016 (Expert Syst. Appl., 2022)

Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. - Yan Jin 005; Bowen Xiong; Kun He 001; Jin-Kao Hao; Chu-Min Li 001; Zhang-Hua Fu (IEEE Trans. Computers, 2022)

Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem. - Yan Jin 005; Yuandong Ding; Xuanhao Pan; Kun He 001; Li Zhao 007; Tao Qin 001; Lei Song 001; Jiang Bian 002 (AAAI, 2023)

H-TSP: Hierarchically Solving the Large-Scale Traveling Salesman Problem. - Xuanhao Pan; Yan Jin 005; Yuandong Ding; Mingxiao Feng; Li Zhao 007; Lei Song 001; Jiang Bian 002 (AAAI, 2023)

Relaxed Graph Color Bound for the Maximum k-plex Problem. - Jiongzhi Zheng; Mingming Jin; Yan Jin 005; Kun He 001 (CoRR, 2023)

H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem. - Xuanhao Pan; Yan Jin 005; Yuandong Ding; Mingxiao Feng; Li Zhao 007; Lei Song 001; Jiang Bian 002 (CoRR, 2023)

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (Knowl. Based Syst., 2023)

Integrating multi-armed bandit with local search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (Artif. Intell., 2025)