Una Benlic

According to our database1, Una Benlic authored at least 36 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An effective hybrid evolutionary algorithm for the set orienteering problem.
Inf. Sci., January, 2024

2023
A parallel adaptive memory algorithm for the capacitated modular hub location problem.
Comput. Oper. Res., May, 2023

2022
Reinforcement learning based tabu search for the minimum load coloring problem.
Comput. Oper. Res., 2022

A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2022

Reinforcement learning based coarse-to-fine search for the maximum k-plex problem.
Appl. Soft Comput., 2022

2021
Iterated multilevel simulated annealing for large-scale graph conductance minimization.
Inf. Sci., 2021

A highly effective hybrid evolutionary algorithm for the covering salesman problem.
Inf. Sci., 2021

2020
A Matheuristic Algorithm for the Inventory Routing Problem.
Transp. Sci., 2020

A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects.
IEEE Trans. Emerg. Top. Comput. Intell., 2020

A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks.
Inf. Sci., 2020

An opposition-based memetic algorithm for the maximum quasi-clique problem.
Eur. J. Oper. Res., 2020

An effective memetic algorithm for the generalized bike-sharing rebalancing problem.
Eng. Appl. Artif. Intell., 2020

2019
Heuristic search to the capacitated clustering problem.
Eur. J. Oper. Res., 2019

Memetic algorithm for the multiple traveling repairman problem with profits.
Eng. Appl. Artif. Intell., 2019

Effective reinforcement learning based local search for the maximum k-plex problem.
CoRR, 2019

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem.
Comput. Oper. Res., 2019

Heuristic Search for a Real-World 3D Stock Cutting Problem.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints.
Eur. J. Oper. Res., 2018

Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2018

A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection.
Comput. Oper. Res., 2018

2017
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem.
Eur. J. Oper. Res., 2017

Breakout local search for the multi-objective gate allocation problem.
Comput. Oper. Res., 2017

2016
Clustering of Maintenance Tasks for the Danish Railway System.
Proceedings of the Intelligent Systems Design and Applications, 2016

2015
Memetic search for the quadratic assignment problem.
Expert Syst. Appl., 2015

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling.
Comput. Oper. Res., 2015

2013
Hybrid Metaheuristics for the Graph Partitioning Problem.
Proceedings of the Hybrid Metaheuristics, 2013

Breakout Local Search for the Max-Cutproblem.
Eng. Appl. Artif. Intell., 2013

Breakout Local Search for maximum clique problems.
Comput. Oper. Res., 2013

Breakout local search for the quadratic assignment problem.
Appl. Math. Comput., 2013

Breakout Local Search for the Vertex Separator Problem.
Proceedings of the IJCAI 2013, 2013

A Study of Adaptive Perturbation Strategy for Iterated Local Search.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

2012
A Study of Breakout Local Search for the Minimum Sum Coloring Problem.
Proceedings of the Simulated Evolution and Learning - 9th International Conference, 2012

2011
A Multilevel Memetic Approach for Improving Graph k-Partitions.
IEEE Trans. Evol. Comput., 2011

Lower bounds for the ITC-2007 curriculum-based course timetabling problem.
Eur. J. Oper. Res., 2011

An effective multilevel tabu search approach for balanced graph partitioning.
Comput. Oper. Res., 2011

2010
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010


  Loading...