Publications
* Song, M. S., Kulp, A., Lu, Y., and Vasko, F. J. (2026). "Determining When Gurobi Generates Optimal Solutions for the Partial Coverage Weighted Set Covering Problem", Computation, 14(3), 68. https://doi.org/10.3390/computation14030068
* Vasko, F. J., Lu, Y., and Song, M. S. (2026). "The role of mathematical formulation in solving the unbalanced assignment problem", International Journal of Industrial Optimization, 7(1), 39-43. https://doi.org/10.12928/ijio.v7i1.12987
* Song, M. S., Cadiz, P., Lu, Y., Swan, E., and Vasko, F. J. (2026). "A Simple Hybrid Approach for Solving Set Covering Problems with Conflict Constraints", Mathematics, 14(2), 342. https://doi.org/10.3390/math14020342
* Cadiz, P., Lu, Y., Song, M. S., and Vasko, F. J. (2026). "Determining the Best Algorithm for the Knapsack Problem with Forfeits", Mathematics, 14(1), 143. Special Issue: Metaheuristic Algorithms, 2nd Edition. https://doi.org/10.3390/math14010143
* Kulp, A., Lu, Y., Song, M. S., and Vasko, F. J. (2025). "The Knapsack Problem with Conflicts: The Advantage of More than One Knapsack", WSEAS Transactions on Computers, 24, 183-188. https://doi.org/10.37394/23205.2025.24.19
* Song, M. S., Lin, P., Lu, Y., and Vasko, F. J. (2025). "Identifying Knapsack Problems with Conflicts that are Difficult to Solve Optimally using General-Purpose Integer Programming Software". Operations Research Forum, 6(3), 88. https://doi.org/10.1007/s43069-025-00496-z
* Lin, P., Lu, Y., Song, M. S., and Vasko, F. J. (2025). "Making Gurobi Competitive with the Best Specialized Algorithms for the Multiple Knapsack Problem with Setups: Implications for OR Practitioners", International Journal of Computational and Applied Mathematics & Computer Science, 5, 12-23, 10.37394/232028.2025.5.2
* Song, M. S., Lin, P., Shively-Ertas, E., Lu, Y., and Vasko, F. J. (2025). "A Practical Approach for Dealing with Hard Knapsack Problems using General-Purpose Integer Programming Software", International Transactions in Operational Research. 32(3), 1472-1493. http://doi.org/10.1111/itor.13449
* Song, M. S., Lu, Y., Rando, D., and Vasko, F. J. (2025). "Statistical Analyses of Solution Methods for the Multiple-Choice Knapsack Problem with Setups: Implications for OR Practitioners", Expert Systems with Applications, 262 (2025), 125622. https://doi.org/10.1016/j.eswa.2024.125622
* Vasko, F. J., Lu, Y., Song, M. S., and Rando, D. (2025). "Filling the Gap in Weighted Set Covering Problem Test Instances", International Journal of Industrial Optimization, 6(1), 17-27. https://doi.org/10.12928/ijio.v6i1.10836
* Rando, D., Lu, Y., Song, M. S., and Vasko, F. J. (2024). "The importance of fine-tuning Gurobi parameters when solving Quadratic Knapsack Problems: A Guide for OR Practitioners", Pure and New Mathematics in AI, 1(1), 8052. https://doi.org/10.24294/pnmai8052
* Vasko, F. J., Lu, Y., Shively-Ertas, E., and Song, M. S. (2024). "Efficiently Generating Bounded Solutions for Very Large Multiple Knapsack Assignment Problems", Journal of Computational and Cognitive Engineering, 3(1), 1-7. https://doi.org/10.47852/bonviewJCCE3202921
* Dellinger, A., Lu, Y., Song, M. S., and Vasko, F. J. (2023). "Simple Strategies that generate Bounded Solutions for the Multiple-choice Multidimensional Knapsack Problem: a guide for OR Practitioners", International Transactions in Operational Research, 30(6), 4061-4077. https://doi.org/10.1111/itor.13144
* Emerick, B., Song, M. S., Lu, Y., Vasko, F. J. (2023). "An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering", Optimization and Learning, Springer, Cham, 1824, 175-185. https://doi.org/10.1007/978-3-031-34020-8_13
* Shively-Ertas, E., Lu, Y., Song, M. S., Vasko, F. J. (2023). "Using General-Purpose Integer Programming Software to Generate Bounded Solutions for the Multiple Knapsack Problem: a Guide for OR Practitioners ", International Jou
