A memetic algorithm for the minimum sum coloring problem Y Jin, JK Hao, JP Hamiez Computers & Operations Research 43, 318-327, 2014 | 58 | 2014 |

An efficient deterministic heuristic for two-dimensional rectangular packing K He, W Huang, Y Jin Computers & Operations Research 39 (7), 1355-1363, 2012 | 53 | 2012 |

General swap-based multiple neighborhood tabu search for the maximum independent set problem Y Jin, JK Hao Engineering Applications of Artificial Intelligence 37, 20-33, 2015 | 49 | 2015 |

Hybrid evolutionary search for the minimum sum coloring problem of graphs Y Jin, JK Hao Information Sciences 352, 15-34, 2016 | 48 | 2016 |

Algorithms for the minimum sum coloring problem: a review Y Jin, JP Hamiez, JK Hao Artificial Intelligence Review 47 (3), 367-394, 2017 | 44 | 2017 |

Heuristics for two-dimensional strip packing problem with 90 rotations K He, Y Jin, W Huang Expert systems with applications 40 (14), 5542-5550, 2013 | 25 | 2013 |

Combining reinforcement learning with Lin-Kernighan-Helsgaun algorithm for the traveling salesman problem J Zheng, K He, J Zhou, Y Jin, CM Li Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12445 …, 2021 | 18 | 2021 |

Enumerating Maximal *k*-Plexes with Worst-Case Time GuaranteeY Zhou, J Xu, Z Guo, M Xiao, Y Jin Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2442-2449, 2020 | 17 | 2020 |

Solving the Latin square completion problem by memetic graph coloring Y Jin, JK Hao IEEE Transactions on Evolutionary Computation 23 (6), 1015-1028, 2019 | 15 | 2019 |

Effective learning-based hybrid search for bandwidth coloring Y Jin, JK Hao IEEE Transactions on Systems, Man, and Cybernetics: Systems 45 (4), 624-635, 2014 | 12 | 2014 |

基于动作空间求解二维矩形 Packing 问题的高效算法 何琨， 黄文奇， 金燕 软件学报 23 (5), 1037-1044, 2012 | 11 | 2012 |

Minimum sum coloring for large graphs with extraction and backward expansion search Q Wu, Q Zhou, Y Jin, JK Hao Applied Soft Computing 62, 1056-1065, 2018 | 8 | 2018 |

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules P Ji, K He, Y Jin, H Lan, C Li Computers & Operations Research 86, 110-123, 2017 | 7 | 2017 |

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem K He, M Zhang, J Zhou, Y Jin, C Li arXiv preprint arXiv:2001.08540, 2020 | 5 | 2020 |

Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs Y Zhou, Z Wang, Y Jin, ZH Fu Knowledge-Based Systems 211, 106562, 2021 | 2 | 2021 |

Effective reinforcement learning based local search for the maximum k-plex problem Y Jin, JH Drake, U Benlic, K He arXiv preprint arXiv:1903.05537, 2019 | 2 | 2019 |

Packing unequal circles into a square container based on the narrow action spaces. K He, M Dosh, Y Jin, S Zou Sci. China Inf. Sci. 61 (4), 048104:1-048104:3, 2018 | 1 | 2018 |

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems J Zheng, K He, J Zhou, Y Jin, CM Li arXiv preprint arXiv:2207.03876, 2022 | | 2022 |

An effective branch-and-bound algorithm for the maximum s-bundle problem Y Zhou, W Lin, JK Hao, M Xiao, Y Jin European Journal of Operational Research 297 (1), 27-39, 2022 | | 2022 |

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit J Zheng, K He, J Zhou, Y Jin, C Li, F Manya arXiv preprint arXiv:2201.05544, 2022 | | 2022 |