A Numerical Likelihood-Based Approach to Combining Correlation Matrices. - Myung Soon Song; Leon J. Gleser (Commun. Stat. Simul. Comput., 2012)

Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem. - Dylan Gaspar; Yun Lu 003; Myung Soon Song; Francis J. Vasko (Int. J. Metaheuristics, 2020)

Application of Metaheuristic Approaches for the Variable Selection Problem. - Myung Soon Song; Francis J. Vasko; Yun Lu 003; Kyle Callaghan (Int. J. Appl. Metaheuristic Comput., 2022)

An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering Problem. - Brooks Emerick; Myung Soon Song; Yun Lu 003; Francis J. Vasko (OLA, 2023)

Simple strategies that generate bounded solutions for the multiple-choice multi-dimensional knapsack problem: a guide for OR practitioners. - Anthony Dellinger; Yun Lu; Myung Soon Song; Francis J. Vasko (Int. Trans. Oper. Res., 2023)

Statistical analyses of solution methods for the multiple-choice knapsack problem with setups: Implications for OR practitioners. - Myung Soon Song; Yun Lu 003; Dominic Rando; Francis J. Vasko (Expert Syst. Appl., 2025)

A practical approach for dealing with hard knapsack problems using general-purpose integer programming software. - Myung Soon Song; Pei Hua Lin; Yun Lu; Emre Shively-Ertas; Francis J. Vasko (Int. Trans. Oper. Res., 2025)

Identifying Knapsack Problems with Conflicts that Are Difficult to Solve Optimally Using General-Purpose Integer Programming Software. - Myung Soon Song; Pei Hua Lin; Yun Lu; Francis J. Vasko (Oper. Res. Forum, 2025)