Francis J. Vasko

34 papers Journal 32Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Determining When Gurobi Generates Optimal Solutions for the Partial Coverage Weighted Set Covering Problem. Comput. Myung Soon Song, Amber Kulp, Yun Lu, Francis J. Vasko
2025	J	`jnl`	A practical approach for dealing with hard knapsack problems using general-purpose integer programming software. Int. Trans. Oper. Res. Myung Soon Song, Pei Hua Lin, Yun Lu, Emre Shively-Ertas, Francis J. Vasko
2025	J	`jnl`	Identifying Knapsack Problems with Conflicts that Are Difficult to Solve Optimally Using General-Purpose Integer Programming Software. Oper. Res. Forum Myung Soon Song, Pei Hua Lin, Yun Lu, Francis J. Vasko
2025	J	`jnl`	Statistical analyses of solution methods for the multiple-choice knapsack problem with setups: Implications for OR practitioners. Expert Syst. Appl. Myung Soon Song, Yun Lu, Dominic Rando, Francis J. Vasko
2023	—	`conf`	An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering Problem. OLA Brooks Emerick, Myung Soon Song, Yun Lu, Francis J. Vasko
2023	J	`jnl`	Simple strategies that generate bounded solutions for the multiple-choice multi-dimensional knapsack problem: a guide for OR practitioners. Int. Trans. Oper. Res. Anthony Dellinger, Yun Lu, Myung Soon Song, Francis J. Vasko
2022	J	`jnl`	Application of Metaheuristic Approaches for the Variable Selection Problem. Int. J. Appl. Metaheuristic Comput. Myung Soon Song, Francis J. Vasko, Yun Lu, Kyle Callaghan
2020	J	`jnl`	Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem. Int. J. Metaheuristics Dylan Gaspar, Yun Lu, Myung Soon Song, Francis J. Vasko
2017	J	`jnl`	Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study. Int. Trans. Oper. Res. Kenneth Zyma, Julien N. Girard, Eric Landquist, Gregory Schaper, Francis J. Vasko
2016	J	`jnl`	A simple and efficient strategy for solving very large-scale generalized cable-trench problems. Networks Francis J. Vasko, Eric Landquist, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris
2016	J	`jnl`	An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem. Int. J. Metaheuristics Francis J. Vasko, Yun Lu, Kenneth Zyma
2016	—	`conf`	The Generalized Steiner Cable-Trench Problem with Application to Error Correction in Vascular Image Analysis. OR Eric Landquist, Francis J. Vasko, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris
2016	J	`jnl`	What is the best greedy-like heuristic for the weighted set covering problem? Oper. Res. Lett. Francis J. Vasko, Yun Lu, Kenneth Zyma
2015	J	`jnl`	An OR Practitioner's Solution Approach for the Set Covering Problem. Int. J. Appl. Metaheuristic Comput. Yun Lu, Francis J. Vasko
2015	J	`jnl`	Teacher training enhances the teaching-learning-based optimisation metaheuristic when used to solve multiple-choice multidimensional knapsack problems. Int. J. Metaheuristics Kenneth Zyma, Yun Lu, Francis J. Vasko
2011	J	`jnl`	A comprehensive empirical analysis of 16 heuristics for the transportation problem. OR Insight Nelya Storozhyshina, Farzad Pargar, Francis J. Vasko
2011	J	`jnl`	A statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem. J. Oper. Res. Soc. Francis J. Vasko, J. D. Bobeck, M. A. Governale, D. J. Rieksts, J. D. Keffer
2011	J	`jnl`	Balancing a transportation problem: Is it really that simple? OR Insight Francis J. Vasko, Nelya Storozhyshina
2011	J	`jnl`	Using an interval graph approach to efficiently solve the housing benefit data retrieval problem. Int. Trans. Oper. Res. Francis J. Vasko, Jeffrey D. Kunkel, Patrick Gorman
2010	J	`jnl`	A women's collegiate basketball star player helps her team with OR. OR Insight Francis J. Vasko, Rachel Wisemiller, Patrick Gorman
2009	J	`jnl`	Optimizing performance funding at Kutztown University of Pennsylvania. OR Insight Francis J. Vasko, Paul S. Ache III, Lynold K. McGhee, Natalie A. Snow
2009	J	`jnl`	Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems. Int. Trans. Oper. Res. Francis J. Vasko, Christopher L. Bartkowski
2008	J	`jnl`	Strategic Planning: OR to the Rescue. OR Insight Francis J. Vasko, Kenneth L. Stott Jr.
2007	J	`jnl`	Metaheuristics for meltshop scheduling in the steel industry. J. Oper. Res. Soc. Peter A. Huegler, Francis J. Vasko
2005	J	`jnl`	Coal blending models for optimum cokemaking and blast furnace operation. J. Oper. Res. Soc. Francis J. Vasko, Dennis D. Newhart, A. D. Strauss
2003	J	`jnl`	A large-scale application of the partial coverage uncapacitated facility location problem. J. Oper. Res. Soc. Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr., Floyd E. Wolf
2002	J	`jnl`	The cable trench problem: combining the shortest path and minimum spanning tree problems. Comput. Oper. Res. Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.
2000	J	`jnl`	A matching approach for replenishing rectangular stock sizes. J. Oper. Res. Soc. Francis J. Vasko, J. A. McNamara, R. N. Parkes, Floyd E. Wolf, L. R. Woodyatt
1999	J	`jnl`	A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading. Eur. J. Oper. Res. Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr.
1999	J	`jnl`	Penalty-based sequencing strategy implemented within a knowledge-based system. J. Oper. Res. Soc. D. J. Renn, Kenneth L. Stott Jr., Francis J. Vasko
1995	J	`jnl`	Optimizing Continuous Caster Product Dimensions: An Example of a Nonlinear Design Problem in the Steel Industry. SIAM Rev. Francis J. Vasko, Kenneth L. Stott Jr.
1993	J	`jnl`	A real-time one-dimensional cutting stock algorithm for balanced cutting patterns. Oper. Res. Lett. Francis J. Vasko, Micheal L. Cregger, Dennis D. Newhart, Kenneth L. Stott Jr.
1988	J	`jnl`	Solving large set covering problems on a personal computer. Comput. Oper. Res. Francis J. Vasko, Floyd E. Wolf
1987	J	`jnl`	Optimal Selection of Ingot Sizes Via Set Covering. Oper. Res. Francis J. Vasko, Floyd E. Wolf, Kenneth L. Stott Jr.