| Breakout local search for the max-cutproblem U Benlic, JK Hao Engineering Applications of Artificial Intelligence 26 (3), 1162-1173, 2013 | 164 | 2013 |
| Breakout local search for the quadratic assignment problem U Benlic, JK Hao Applied Mathematics and Computation 219 (9), 4800-4815, 2013 | 147 | 2013 |
| Breakout local search for maximum clique problems U Benlic, JK Hao Computers & Operations Research 40 (1), 192-206, 2013 | 128 | 2013 |
| A multilevel memetic approach for improving graph k-partitions U Benlic, JK Hao IEEE Transactions on Evolutionary Computation 15 (5), 624-642, 2011 | 122 | 2011 |
| Memetic search for the quadratic assignment problem U Benlic, JK Hao Expert Systems with Applications 42 (1), 584-595, 2015 | 121 | 2015 |
| An effective multilevel tabu search approach for balanced graph partitioning U Benlic, JK Hao Computers & Operations Research 38 (7), 1066-1075, 2011 | 88 | 2011 |
| Breakout local search for the multi-objective gate allocation problem U Benlic, EK Burke, JR Woodward Computers & Operations Research 78, 80-93, 2017 | 66 | 2017 |
| Heuristic search for allocation of slots at network level U Benlic Transportation Research Part C: Emerging Technologies 86, 488-509, 2018 | 60 | 2018 |
| Heuristic search for the coupled runway sequencing and taxiway routing problem U Benlic, AEI Brownlee, EK Burke Transportation Research Part C: Emerging Technologies 71, 333-355, 2016 | 57 | 2016 |
| A study of breakout local search for the minimum sum coloring problem U Benlic, JK Hao Simulated Evolution and Learning: 9th International Conference, SEAL 2012 …, 2012 | 51 | 2012 |
| Lower bounds for the ITC-2007 curriculum-based course timetabling problem JK Hao, U Benlic European Journal of Operational Research 212 (3), 464-472, 2011 | 51 | 2011 |
| Heuristic search to the capacitated clustering problem Q Zhou, U Benlic, Q Wu, JK Hao European Journal of Operational Research 273 (2), 464-487, 2019 | 41 | 2019 |
| A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection Y Lu, U Benlic, Q Wu Computers & Operations Research 90, 193-207, 2018 | 41 | 2018 |
| An effective memetic algorithm for the generalized bike-sharing rebalancing problem Y Lu, U Benlic, Q Wu Engineering Applications of Artificial Intelligence 95, 103890, 2020 | 39 | 2020 |
| Breakout local search for the vertex separator problem U Benlic, JK Hao Twenty-Third International Joint Conference on Artificial Intelligence, 2013 | 38 | 2013 |
| A matheuristic algorithm for the inventory routing problem Z Su, Z Lü, Z Wang, Y Qi, U Benlic Transportation Science 54 (2), 330-354, 2020 | 30 | 2020 |
| A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints Y Lu, U Benlic, Q Wu European Journal of Operational Research 268 (1), 54-69, 2018 | 30 | 2018 |
| A hybrid breakout local search and reinforcement learning approach to the vertex separator problem U Benlic, MG Epitropakis, EK Burke European Journal of Operational Research 261 (3), 803-818, 2017 | 28 | 2017 |
| An opposition-based memetic algorithm for the maximum quasi-clique problem Q Zhou, U Benlic, Q Wu European Journal of Operational Research 286 (1), 63-83, 2020 | 27 | 2020 |
| A highly effective hybrid evolutionary algorithm for the covering salesman problem Y Lu, U Benlic, Q Wu Information Sciences 564, 144-162, 2021 | 24 | 2021 |