We stand with Ukraine  

Yun Lu

Orcid: 0000-0003-2296-425X

Affiliations:
  • Kutztown University, Kutztown, PA, USA


According to our database1, Yun Lu authored at least 7 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering Problem.
[BibTeX]
[DOI]
Brooks Emerick
,
Myung Soon Song
,
Yun Lu
,
Francis J. Vasko
Proceedings of the Optimization and Learning - 6th International Conference, 2023

2022
Application of Metaheuristic Approaches for the Variable Selection Problem.
[BibTeX]
[DOI]
Myung Soon Song
,
Francis J. Vasko
,
Yun Lu
,
Kyle Callaghan
Int. J. Appl. Metaheuristic Comput., 2022

2020
Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem.
[BibTeX]
[DOI]
Dylan Gaspar
,
Yun Lu
,
Myung Soon Song
,
Francis J. Vasko
Int. J. Metaheuristics, 2020

2016
What is the best greedy-like heuristic for the weighted set covering problem?
[BibTeX]
[DOI]
Francis J. Vasko
,
Yun Lu
,
Kenneth Zyma
Oper. Res. Lett., 2016

An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem.
[BibTeX]
[DOI]
Francis J. Vasko
,
Yun Lu
,
Kenneth Zyma
Int. J. Metaheuristics, 2016

2015
Teacher training enhances the teaching-learning-based optimisation metaheuristic when used to solve multiple-choice multidimensional knapsack problems.
[BibTeX]
[DOI]
Kenneth Zyma
,
Yun Lu
,
Francis J. Vasko
Int. J. Metaheuristics, 2015

An OR Practitioner's Solution Approach for the Set Covering Problem.
[BibTeX]
[DOI]
Yun Lu
,
Francis J. Vasko
Int. J. Appl. Metaheuristic Comput., 2015


  Loading...