An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. - Una Benlic; Jin-Kao Hao (ICTAI (1), 2010)

An effective multilevel tabu search approach for balanced graph partitioning. - Una Benlic; Jin-Kao Hao (Comput. Oper. Res., 2011)

Lower bounds for the ITC-2007 curriculum-based course timetabling problem. - Jin-Kao Hao; Una Benlic (Eur. J. Oper. Res., 2011)

A Multilevel Memetic Approach for Improving Graph k-Partitions. - Una Benlic; Jin-Kao Hao (IEEE Trans. Evol. Comput., 2011)

A Study of Breakout Local Search for the Minimum Sum Coloring Problem. - Una Benlic; Jin-Kao Hao (SEAL, 2012)

A Study of Adaptive Perturbation Strategy for Iterated Local Search. - Una Benlic; Jin-Kao Hao (EvoCOP, 2013)

Breakout Local Search for the Vertex Separator Problem. - Una Benlic; Jin-Kao Hao (IJCAI, 2013)

Breakout local search for the quadratic assignment problem. - Una Benlic; Jin-Kao Hao (Appl. Math. Comput., 2013)

Breakout Local Search for maximum clique problems. - Una Benlic; Jin-Kao Hao (Comput. Oper. Res., 2013)

Breakout Local Search for the Max-Cutproblem. - Una Benlic; Jin-Kao Hao (Eng. Appl. Artif. Intell., 2013)

Hybrid Metaheuristics for the Graph Partitioning Problem. - Una Benlic; Jin-Kao Hao (Hybrid Metaheuristics, 2013)

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. - Tao Qin; Bo Peng 010; Una Benlic; T. C. E. Cheng; Yang Wang 030; Zhipeng Lü (Comput. Oper. Res., 2015)

Memetic search for the quadratic assignment problem. - Una Benlic; Jin-Kao Hao (Expert Syst. Appl., 2015)

Clustering of Maintenance Tasks for the Danish Railway System. - Shahrzad M. Pour; Una Benlic (ISDA, 2016)

Breakout local search for the multi-objective gate allocation problem. - Una Benlic; Edmund K. Burke; John R. Woodward (Comput. Oper. Res., 2017)

A hybrid breakout local search and reinforcement learning approach to the vertex separator problem. - Una Benlic; Michael G. Epitropakis; Edmund K. Burke (Eur. J. Oper. Res., 2017)

A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2018)

Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2018)

A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Eur. J. Oper. Res., 2018)

Heuristic Search for a Real-World 3D Stock Cutting Problem. - Katerina Klimova; Una Benlic (OR, 2019)

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2019)

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)

Memetic algorithm for the multiple traveling repairman problem with profits. - Yongliang Lu; Una Benlic; Qinghua Wu 002; Bo Peng 010 (Eng. Appl. Artif. Intell., 2019)

Heuristic search to the capacitated clustering problem. - Qing Zhou; Una Benlic; Qinghua Wu 002; Jin-Kao Hao (Eur. J. Oper. Res., 2019)

An effective memetic algorithm for the generalized bike-sharing rebalancing problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Eng. Appl. Artif. Intell., 2020)

An opposition-based memetic algorithm for the maximum quasi-clique problem. - Qing Zhou; Una Benlic; Qinghua Wu 002 (Eur. J. Oper. Res., 2020)

A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. - Qing Zhou; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2020)

A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects. - Junwen Ding; Liji Shen; Zhipeng Lü; Liping Xu; Una Benlic (IEEE Trans. Emerg. Top. Comput. Intell., 2020)

A Matheuristic Algorithm for the Inventory Routing Problem. - Zhouxing Su; Zhipeng Lü; Zhuo Wang; Yanmin Qi; Una Benlic (Transp. Sci., 2020)

A highly effective hybrid evolutionary algorithm for the covering salesman problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2021)

Iterated multilevel simulated annealing for large-scale graph conductance minimization. - Zhi Lu; Jin-Kao Hao; Una Benlic; David Lesaint (Inf. Sci., 2021)

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)

A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2022)

Reinforcement learning based tabu search for the minimum load coloring problem. - Zhe Sun; Una Benlic; Mingjie Li; Qinghua Wu 002 (Comput. Oper. Res., 2022)

A parallel adaptive memory algorithm for the capacitated modular hub location problem. - Qinghua Wu 002; Zhe Sun; Una Benlic; Yongliang Lu (Comput. Oper. Res., 2023)

An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. - Mu He; Qinghua Wu 002; Una Benlic; Yongliang Lu; Yuning Chen (Eur. J. Oper. Res., 2024)

An effective hybrid evolutionary algorithm for the set orienteering problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2024)

Solving soft and hard-clustered vehicle routing problems: A bi-population collaborative memetic search approach. - Yangming Zhou; Lingheng Liu; Una Benlic; Zhi-Chun Li; Qinghua Wu (Eur. J. Oper. Res., 2025)