default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYun Lu 0003
Person information
- affiliation: Kutztown University, Kutztown, PA, USA
Other persons with the same name
- Yun Lu — disambiguation page
- Yun Lu 0001
![[0000-0002-0098-0577]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0098-0577")
— University of Edinburgh, Edinburgh, UK (and 1 more) - Yun Lu 0002 — Beijing Institute of Technology, School of Mechanical Engineering, China (and 1 more)
- Yun Lu 0004 — Huizhou University, School of Computer Science and Engineering, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Myung Soon Song, Yun Lu, Dominic Rando, Francis J. Vasko:
Statistical analyses of solution methods for the multiple-choice knapsack problem with setups: Implications for OR practitioners. Expert Syst. Appl. 262: 125622 (2025)- 2023
- [c1]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: 175-185 - 2022
- [j6]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): 1-22 (2022) - 2020
- [j5]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): 330-351 (2020)
2010 – 2019
- 2016
- [j4]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): 193-225 (2016) - [j3]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): 366-369 (2016) - 2015
- [j2]Yun Lu, Francis J. Vasko:
An OR Practitioner's Solution Approach for the Set Covering Problem. Int. J. Appl. Metaheuristic Comput. 6(4): 1-13 (2015) - [j1]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): 268-293 (2015)
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-12-18 19:24 CET 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:
