Francis J. Vasko

According to our database, Francis J. Vasko authored at least 31 papers between 1987 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2025

Statistical analyses of solution methods for the multiple-choice knapsack problem with setups: Implications for OR practitioners.

Myung Soon Song, Yun Lu, Dominic Rando, Francis J. Vasko

Expert Syst. Appl., 2025

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., November, 2023

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, Francis J. Vasko

Proceedings of the Optimization and Learning - 6th International Conference, 2023

2022

Application of Metaheuristic Approaches for the Variable Selection Problem.

Myung Soon Song, Francis J. Vasko, Yun Lu, Kyle Callaghan

Int. J. Appl. Metaheuristic Comput., 2022

2020

Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem.

Dylan Gaspar, Yun Lu, Myung Soon Song, Francis J. Vasko

Int. J. Metaheuristics, 2020

2017

Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study.

Kenneth Zyma, Julien N. Girard, Eric Landquist, Gregory Schaper, Francis J. Vasko

Int. Trans. Oper. Res., 2017

2016

What is the best greedy-like heuristic for the weighted set covering problem?

Francis J. Vasko, Yun Lu, Kenneth Zyma

Oper. Res. Lett., 2016

A simple and efficient strategy for solving very large-scale generalized cable-trench problems.

Francis J. Vasko, Eric Landquist, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris

Networks, 2016

An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem.

Francis J. Vasko, Yun Lu, Kenneth Zyma

Int. J. Metaheuristics, 2016

The Generalized Steiner Cable-Trench Problem with Application to Error Correction in Vascular Image Analysis.

Eric Landquist, Francis J. Vasko, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015

Teacher training enhances the teaching-learning-based optimisation metaheuristic when used to solve multiple-choice multidimensional knapsack problems.

Kenneth Zyma, Yun Lu, Francis J. Vasko

Int. J. Metaheuristics, 2015

An OR Practitioner's Solution Approach for the Set Covering Problem.

Yun Lu, Francis J. Vasko

Int. J. Appl. Metaheuristic Comput., 2015

2011

Balancing a transportation problem: Is it really that simple?

Francis J. Vasko, Nelya Storozhyshina

OR Insight, 2011

A comprehensive empirical analysis of 16 heuristics for the transportation problem.

Nelya Storozhyshina, Farzad Pargar, Francis J. Vasko

OR Insight, 2011

A statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem.

Francis J. Vasko, J. D. Bobeck, M. A. Governale, D. J. Rieksts, J. D. Keffer

J. Oper. Res. Soc., 2011

Using an interval graph approach to efficiently solve the housing benefit data retrieval problem.

Francis J. Vasko, Jeffrey D. Kunkel, Patrick Gorman

Int. Trans. Oper. Res., 2011

2010

A women's collegiate basketball star player helps her team with OR.

Francis J. Vasko, Rachel Wisemiller, Patrick Gorman

OR Insight, 2010

2009

Optimizing performance funding at Kutztown University of Pennsylvania.

Francis J. Vasko, Paul S. Ache III, Lynold K. McGhee, Natalie A. Snow

OR Insight, 2009

Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems.

Francis J. Vasko, Christopher L. Bartkowski

Int. Trans. Oper. Res., 2009

2008

Strategic Planning: OR to the Rescue.

Francis J. Vasko, Kenneth L. Stott Jr.

OR Insight, 2008

2007

Metaheuristics for meltshop scheduling in the steel industry.

Peter A. Huegler, Francis J. Vasko

J. Oper. Res. Soc., 2007

2005

Coal blending models for optimum cokemaking and blast furnace operation.

Francis J. Vasko, Dennis D. Newhart, A. D. Strauss

J. Oper. Res. Soc., 2005

2003

A large-scale application of the partial coverage uncapacitated facility location problem.

Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr., Floyd E. Wolf

J. Oper. Res. Soc., 2003

2002

The cable trench problem: combining the shortest path and minimum spanning tree problems.

Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.

Comput. Oper. Res., 2002

2000

A matching approach for replenishing rectangular stock sizes.

Francis J. Vasko, J. A. McNamara, R. N. Parkes, Floyd E. Wolf, L. R. Woodyatt

J. Oper. Res. Soc., 2000

1999

Penalty-based sequencing strategy implemented within a knowledge-based system.

D. J. Renn, Kenneth L. Stott Jr., Francis J. Vasko

J. Oper. Res. Soc., 1999

A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading.

Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott Jr.

Eur. J. Oper. Res., 1999

1995

Optimizing Continuous Caster Product Dimensions: An Example of a Nonlinear Design Problem in the Steel Industry.

Francis J. Vasko, Kenneth L. Stott Jr.

SIAM Rev., 1995

1993

A real-time one-dimensional cutting stock algorithm for balanced cutting patterns.

Francis J. Vasko, Micheal L. Cregger, Dennis D. Newhart, Kenneth L. Stott Jr.

Oper. Res. Lett., 1993

1988

Solving large set covering problems on a personal computer.

Francis J. Vasko, Floyd E. Wolf

Comput. Oper. Res., 1988

1987

Optimal Selection of Ingot Sizes Via Set Covering.

Francis J. Vasko, Floyd E. Wolf, Kenneth L. Stott Jr.

Oper. Res., 1987