​
Login / Signup
Yun Lu
ORCID
Publication Activity (10 Years)
Years Active: 2015-2023
Publications (10 Years): 5
Top Topics
Tabu Search
Metaheuristic
Multidimensional Knapsack Problem
Set Covering
Top Venues
Int. J. Metaheuristics
Int. J. Appl. Metaheuristic Comput.
Oper. Res. Lett.
</>
Publications
</>
Brooks Emerick
,
Myung Soon Song
,
Yun Lu
,
Francis J. Vasko
An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering Problem.
OLA
(2023)
Myung Soon Song
,
Francis J. Vasko
,
Yun Lu
,
Kyle Callaghan
Application of Metaheuristic Approaches for the Variable Selection Problem.
Int. J. Appl. Metaheuristic Comput.
13 (1) (2022)
Dylan Gaspar
,
Yun Lu
,
Myung Soon Song
,
Francis J. Vasko
Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem.
Int. J. Metaheuristics
7 (4) (2020)
Francis J. Vasko
,
Yun Lu
,
Kenneth Zyma
What is the best greedy-like heuristic for the weighted set covering problem?
Oper. Res. Lett.
44 (3) (2016)
Francis J. Vasko
,
Yun Lu
,
Kenneth Zyma
An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem.
Int. J. Metaheuristics
5 (3/4) (2016)
Kenneth Zyma
,
Yun Lu
,
Francis J. Vasko
Teacher training enhances the teaching-learning-based optimisation metaheuristic when used to solve multiple-choice multidimensional knapsack problems.
Int. J. Metaheuristics
4 (3/4) (2015)
Yun Lu
,
Francis J. Vasko
An OR Practitioner's Solution Approach for the Set Covering Problem.
Int. J. Appl. Metaheuristic Comput.
6 (4) (2015)