Francis J. Vasko

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 9

Top Topics

Knapsack Problem

Top Venues

Int. J. Metaheuristics

Int. J. Appl. Metaheuristic Comput.

Int. Trans. Oper. Res.

Oper. Res. Lett.

Publications

Anthony Dellinger, Yun Lu, Myung Soon Song, Francis J. Vasko
Simple strategies that generate bounded solutions for the multiple-choice multi-dimensional knapsack problem: a guide for OR practitioners. Int. Trans. Oper. Res. 30 (6) (2023)
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)
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) (2022)
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) (2020)
Kenneth Zyma, Julien N. Girard, Eric Landquist, Gregory Schaper, Francis J. Vasko
Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study. Int. Trans. Oper. Res. 24 (5) (2017)
Eric Landquist, Francis J. Vasko, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris
The Generalized Steiner Cable-Trench Problem with Application to Error Correction in Vascular Image Analysis. OR (2016)
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) (2016)
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) (2016)
Francis J. Vasko, Eric Landquist, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris
A simple and efficient strategy for solving very large-scale generalized cable-trench problems. Networks 67 (3) (2016)
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) (2015)
Yun Lu, Francis J. Vasko
An OR Practitioner's Solution Approach for the Set Covering Problem. Int. J. Appl. Metaheuristic Comput. 6 (4) (2015)
Francis J. Vasko, Nelya Storozhyshina
Balancing a transportation problem: Is it really that simple? OR Insight 24 (3) (2011)
Nelya Storozhyshina, Farzad Pargar, Francis J. Vasko
A comprehensive empirical analysis of 16 heuristics for the transportation problem. OR Insight 24 (1) (2011)
Francis J. Vasko, Jeffrey D. Kunkel, Patrick Gorman
Using an interval graph approach to efficiently solve the housing benefit data retrieval problem. Int. Trans. Oper. Res. 18 (4) (2011)
Francis J. Vasko, J. D. Bobeck, M. A. Governale, D. J. Rieksts, J. D. Keffer
A statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem. J. Oper. Res. Soc. 62 (6) (2011)
Francis J. Vasko, Rachel Wisemiller, Patrick Gorman
A women's collegiate basketball star player helps her team with OR. OR Insight 23 (2) (2010)
Francis J. Vasko, Paul S. Ache III, Lynold K. McGhee, Natalie A. Snow
Optimizing performance funding at Kutztown University of Pennsylvania. OR Insight 22 (1) (2009)
Francis J. Vasko, Christopher L. Bartkowski
Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems. Int. Trans. Oper. Res. 16 (6) (2009)
Francis J. Vasko, Kenneth L. Stott Jr.
Strategic Planning: OR to the Rescue. OR Insight 21 (3) (2008)
Peter A. Huegler, Francis J. Vasko
Metaheuristics for meltshop scheduling in the steel industry. J. Oper. Res. Soc. 58 (6) (2007)
Francis J. Vasko, Dennis D. Newhart, A. D. Strauss
Coal blending models for optimum cokemaking and blast furnace operation. J. Oper. Res. Soc. 56 (3) (2005)
Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr., Floyd E. Wolf
A large-scale application of the partial coverage uncapacitated facility location problem. J. Oper. Res. Soc. 54 (1) (2003)
Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.
The cable trench problem: combining the shortest path and minimum spanning tree problems. Comput. Oper. Res. 29 (5) (2002)
Francis J. Vasko, J. A. McNamara, R. N. Parkes, Floyd E. Wolf, L. R. Woodyatt
A matching approach for replenishing rectangular stock sizes. J. Oper. Res. Soc. 51 (3) (2000)
D. J. Renn, Kenneth L. Stott Jr., Francis J. Vasko
Penalty-based sequencing strategy implemented within a knowledge-based system. J. Oper. Res. Soc. 50 (3) (1999)
Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr.
A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading. Eur. J. Oper. Res. 114 (1) (1999)
Francis J. Vasko, Kenneth L. Stott Jr.
Optimizing Continuous Caster Product Dimensions: An Example of a Nonlinear Design Problem in the Steel Industry. SIAM Rev. 37 (1) (1995)
Francis J. Vasko, Micheal L. Cregger, Dennis D. Newhart, Kenneth L. Stott Jr.
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns. Oper. Res. Lett. 14 (5) (1993)
Francis J. Vasko, Floyd E. Wolf
Solving large set covering problems on a personal computer. Comput. Oper. Res. 15 (2) (1988)
Francis J. Vasko, Floyd E. Wolf, Kenneth L. Stott Jr.
Optimal Selection of Ingot Sizes Via Set Covering. Oper. Res. 35 (3) (1987)