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

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

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

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 | 43 | 2015 |

Algorithms for the minimum sum coloring problem: a review Y Jin, JP Hamiez, JK Hao Artificial Intelligence Review 47 (3), 367-394, 2017 | 39 | 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 | 23 | 2013 |

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

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

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 | 9 | 2014 |

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 |

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 | 6 | 2020 |

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem J Zheng, K He, J Zhou, Y Jin, CM Li arXiv preprint arXiv:2012.04461, 2020 | 4 | 2020 |

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 | 3 | 2020 |

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 Science China Information Sciences 61 (4), 1-3, 2018 | 1 | 2018 |

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, 2021 | | 2021 |

A Quasi-Newton-based Floorplanner for fixed-outline floorplanning P Ji, K He, Z Wang, Y Jin, J Wu Computers & Operations Research 129, 105225, 2021 | | 2021 |

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 | | 2021 |

The Orthogonal Packing and Scheduling Problem: Model, Heuristic, and Benchmark K He, H Yang, Y Jin, Q Hu, P Ji IEEE Transactions on Systems, Man, and Cybernetics: Systems 50 (4), 2020 | | 2020 |