Francis J. Vasko

发表

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, 2017, Int. Trans. Oper. Res..

Balancing a transportation problem: Is it really that simple?

Francis J. Vasko, Nelya Storozhyshina, F. Vasko, 2011, OR Insight.

A Practical Solution to a Cargo Loading Problem at Bethlehem Steel

Francis J. Vasko, John A. McNamara, Dennis D. Newhart, 1994 .

A Dynamic Programming Model for Determining Continuous-Caster Configurations

Francis J. Vasko, D. C. Friedel, 1982 .

Coal blending models for optimum cokemaking and blast furnace operation

Francis J. Vasko, Dennis D. Newhart, A. D. Strauss, 2005, J. Oper. Res. Soc..

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

Francis J. Vasko, Dylan Gaspar, Yun Lu, 2020, IJMHeur.

Using fuzzy sets to assign metallurgical grades to steel

Francis J. Vasko, Floyd E. Wolf, L. Richard Woodyatt, 1992 .

Multiple-Attribute-Based Expert Support System for Customer/Order Evaluation

Francis J. Vasko, Dennis D. Newhart, Michael L. Cregger, 1990 .

Strategic Planning: OR to the Rescue

Francis J. Vasko, Kenneth L. Stott, 2008, OR Insight.

Bethlehem steel combines cutting stock and set covering to enhance customer service

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

A comprehensive empirical analysis of 16 heuristics for the transportation problem

Francis J. Vasko, Nelya Storozhyshina, Farzad Pargar, 2011, OR Insight.

Solving large set covering problems on a personal computer

Francis J. Vasko, Floyd E. Wolf, 1988, Comput. Oper. Res..

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

Francis J. Vasko, Brian Q. Rieksts, Kenneth L. Stott, 2002, Comput. Oper. Res..

A Multiple-criteria Approach to Dynamic Cold-ingot Substitution

Francis J. Vasko, John A. McNamara, Floyd E. Wolf, 1989 .

A performance comparison of heuristics for the total weighted tardiness problem

Francis J. Vasko, Peter A. Huegler, 1997 .

Fiddler on the Roof

Francis J. Vasko, Dennis D. Newhart, Floyd E. Wolf, 2000 .

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

Francis J. Vasko, Dylan Gaspar, Yun Lu, 2020 .

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

Xenophon Papademetris, Yifeng Jiang, Eric Landquist, 2016, OR.

An Efficient Heuristic for Planning Mother Plate Requirements at Bethlehem Steel

Francis J. Vasko, Floyd E. Wolf, John A. Pflugrad, 1991 .

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

Francis J. Vasko, Christopher L. Bartkowski, 2009, Int. Trans. Oper. Res..

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

Francis J. Vasko, Dennis D. Newhart, Kenneth L. Stott, 1993, Oper. Res. Lett..

Optimal Selection of Ingot Sizes Via Set Covering

Francis J. Vasko, Floyd E. Wolf, Kenneth L. Stott, 1987, Oper. Res..

Metaheuristics for meltshop scheduling in the steel industry

Francis J. Vasko, P. A. Huegler, P. Huegler, 2007, J. Oper. Res. Soc..

A computational improvement to Wang's two-dimensional cutting stock algorithm

Francis J. Vasko, 1989 .

Optimizing performance funding at Kutztown University of Pennsylvania

Francis J. Vasko, Paul S. Ache, Lynold K. McGhee, 2009, OR Insight.

Consolidating Product Sizes to Minimize Inventory Levels for a Multi-Stage Production and Distribution System

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

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, 2011, J. Oper. Res. Soc..

An OR practitioner’s solution approach to the multidimensional knapsack problem

Yun Lu, Francis J. Vasko, Zachary Kern, 2020 .

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

Francis J. Vasko, Patrick Gorman, Rachel Wisemiller, 2010, OR Insight.

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

Francis J. Vasko, Dennis D. Newhart, Floyd E. Wolf, 2003, J. Oper. Res. Soc..

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

Yun Lu, Kenneth Zyma, Francis J. Vasko, 2016, Int. J. Metaheuristics.

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

Francis J. Vasko, Kenneth L. Stott, 1995, SIAM Rev..

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

Francis J. Vasko, Patrick Gorman, Jeffrey D. Kunkel, 2011, Int. Trans. Oper. Res..

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

Yun Lu, Kenneth Zyma, Francis J. Vasko, 2015, Int. J. Metaheuristics.

Selecting Optimal Ingot Sizes for Bethlehem Steel

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

Adapting Branch-and-Bound for Real-World Scheduling Problems

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

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

Yun Lu, Kenneth Zyma, Francis J. Vasko, 2016, Oper. Res. Lett..

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

Yun Lu, Francis J. Vasko, 2015, Int. J. Appl. Metaheuristic Comput..

A set covering approach to metallurgical grade assignment

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

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, 1999, Eur. J. Oper. Res..

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

Francis J. Vasko, Kenneth L. Stott, D J Renn, 1999, J. Oper. Res. Soc..

Using machine learning to predict the number of alternative solutions to a minimum cardinality set covering problem

Francis J. Vasko, Yun Lu, Brooks Emerick, 2021 .

When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

Francis J. Vasko, Yun Lu, Myung Soon Song, 2021, Engineering Optimization.

Using a Facility Location Algorithm to Determine Optimum Cast Bloom Lengths

Francis J. Vasko, Dennis D. Newhart, Floyd E. Wolf, 1996 .

Assigning slabs to orders: an example of appropriate model formulation

Francis J. Vasko, Kenneth L. Stott, Micheal L. Cregger, 1994 .

An application combining set covering and fuzzy sets to optimally assign metallurgical grades to customer orders

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

Solving the Unbalanced Assignment Problem: Simpler Is Better

Francis J. Vasko, F. J. Vasko, Nathan K. Betts, 2016 .

A Practical Approach for Determining Rectangular Stock Sizes

Francis J. Vasko, Floyd E. Wolf, F. E. Wolf, 1994 .

A practical solution to a fuzzy two-dimensional cutting stock problem

Francis J. Vasko, F. J. Vasko, F. E. Wolf, 1989 .

An efficient heuristic for large set covering problems

Francis J. Vasko, F. J. Vasko, 1984 .

A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®

Yun Lu, Francis J. Vasko, Francis J. Vasko, 2020, Engineering Optimization.

Simple strategies that generate bounded solutions for the multiple-choice multi-dimensional knapsack problem: a guide for OR practitioners

Francis J. Vasko, Yun Lu, M. Song, 2022, Int. Trans. Oper. Res..