default search action
Una Benlic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Mu He, Qinghua Wu, Una Benlic, Yongliang Lu, Yuning Chen:
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. Eur. J. Oper. Res. 318(3): 778-801 (2024) - [j28]Yongliang Lu, Una Benlic, Qinghua Wu
:
An effective hybrid evolutionary algorithm for the set orienteering problem. Inf. Sci. 654: 119813 (2024) - 2023
- [j27]Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu:
A parallel adaptive memory algorithm for the capacitated modular hub location problem. Comput. Oper. Res. 153: 106173 (2023) - 2022
- [j26]Yan Jin, John H. Drake, Kun He, Una Benlic:
Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. Appl. Soft Comput. 131: 109758 (2022) - [j25]Zhe Sun, Una Benlic, Mingjie Li, Qinghua Wu
Reinforcement learning based tabu search for the minimum load coloring problem. Comput. Oper. Res. 143: 105745 (2022) - [j24]Yongliang Lu, Una Benlic, Qinghua Wu
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144: 105799 (2022) - 2021
- [j23]Yongliang Lu, Una Benlic, Qinghua Wu:
A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf. Sci. 564: 144-162 (2021) - [j22]Zhi Lu
Iterated multilevel simulated annealing for large-scale graph conductance minimization. Inf. Sci. 572: 182-199 (2021) - 2020
- [j21]Yongliang Lu, Una Benlic, Qinghua Wu:
An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Eng. Appl. Artif. Intell. 95: 103890 (2020) - [j20]Qing Zhou, Una Benlic, Qinghua Wu:
An opposition-based memetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 286(1): 63-83 (2020) - [j19]Qing Zhou, Una Benlic, Qinghua Wu
A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. Inf. Sci. 541: 271-296 (2020) - [j18]Junwen Ding
A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects. IEEE Trans. Emerg. Top. Comput. Intell. 4(3): 385-397 (2020) - [j17]Zhouxing Su
A Matheuristic Algorithm for the Inventory Routing Problem. Transp. Sci. 54(2): 330-354 (2020)
2010 – 2019
- 2019
- [j16]Yongliang Lu, Una Benlic, Qinghua Wu:
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 101: 285-297 (2019) - [j15]Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng:
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80: 35-47 (2019) - [j14]Qing Zhou, Una Benlic, Qinghua Wu, Jin-Kao Hao
Heuristic search to the capacitated clustering problem. Eur. J. Oper. Res. 273(2): 464-487 (2019) - [c6]Katerina Klimova, Una Benlic:
Heuristic Search for a Real-World 3D Stock Cutting Problem. OR 2019: 63-69 - [i1]Yan Jin, John H. Drake, Una Benlic, Kun He:
Effective reinforcement learning based local search for the maximum k-plex problem. CoRR abs/1903.05537 (2019) - 2018
- [j13]Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. Comput. Oper. Res. 90: 193-207 (2018) - [j12]Yongliang Lu, Una Benlic, Qinghua Wu:
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 97: 18-30 (2018) - [j11]Yongliang Lu, Una Benlic, Qinghua Wu:
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. Eur. J. Oper. Res. 268(1): 54-69 (2018) - 2017
- [j10]Una Benlic, Edmund K. Burke
Breakout local search for the multi-objective gate allocation problem. Comput. Oper. Res. 78: 80-93 (2017) - [j9]Una Benlic, Michael G. Epitropakis
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem. Eur. J. Oper. Res. 261(3): 803-818 (2017) - 2016
- [c5]Shahrzad M. Pour, Una Benlic:
Clustering of Maintenance Tasks for the Danish Railway System. ISDA 2016: 791-799 - 2015
- [j8]Tao Qin, Bo Peng, Una Benlic, T. C. E. Cheng
Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. Comput. Oper. Res. 61: 81-88 (2015) - [j7]Una Benlic, Jin-Kao Hao:
Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42(1): 584-595 (2015) - 2013
- [j6]Una Benlic, Jin-Kao Hao
Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9): 4800-4815 (2013) - [j5]Una Benlic, Jin-Kao Hao
Breakout Local Search for maximum clique problems. Comput. Oper. Res. 40(1): 192-206 (2013) - [j4]Una Benlic, Jin-Kao Hao
Breakout Local Search for the Max-Cutproblem. Eng. Appl. Artif. Intell. 26(3): 1162-1173 (2013) - [c4]Una Benlic, Jin-Kao Hao
A Study of Adaptive Perturbation Strategy for Iterated Local Search. EvoCOP 2013: 61-72 - [c3]Una Benlic, Jin-Kao Hao:
Breakout Local Search for the Vertex Separator Problem. IJCAI 2013: 461-467 - [p1]Una Benlic, Jin-Kao Hao:
Hybrid Metaheuristics for the Graph Partitioning Problem. Hybrid Metaheuristics 2013: 157-185 - 2012
- [c2]Una Benlic, Jin-Kao Hao
A Study of Breakout Local Search for the Minimum Sum Coloring Problem. SEAL 2012: 128-137 - 2011
- [j3]Una Benlic, Jin-Kao Hao
An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38(7): 1066-1075 (2011) - [j2]Jin-Kao Hao
Lower bounds for the ITC-2007 curriculum-based course timetabling problem. Eur. J. Oper. Res. 212(3): 464-472 (2011) - [j1]Una Benlic, Jin-Kao Hao
A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Trans. Evol. Comput. 15(5): 624-642 (2011) - 2010
- [c1]Una Benlic, Jin-Kao Hao
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. ICTAI (1) 2010: 121-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-15 23:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: