default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis J. Vasko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]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): 4061-4077 (2023)- [c2]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: 175-185 - 2022
- [j27]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): 1-22 (2022) - 2020
- [j26]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): 330-351 (2020)
2010 – 2019
- 2017
- [j25]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): 943-957 (2017) - 2016
- [j24]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): 193-225 (2016) - [j23]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): 199-208 (2016) - [j22]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): 366-369 (2016) - [c1]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: 391-397 - 2015
- [j21]Yun Lu, Francis J. Vasko:
An OR Practitioner's Solution Approach for the Set Covering Problem. Int. J. Appl. Metaheuristic Comput. 6(4): 1-13 (2015) - [j20]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): 268-293 (2015) - 2011
- [j19]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): 449-453 (2011) - [j18]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): 1169-1176 (2011) - [j17]Nelya Storozhyshina, Farzad Pargar, Francis J. Vasko:
A comprehensive empirical analysis of 16 heuristics for the transportation problem. OR Insight 24(1): 63-76 (2011) - [j16]Francis J. Vasko, Nelya Storozhyshina:
Balancing a transportation problem: Is it really that simple? OR Insight 24(3): 205-214 (2011) - 2010
- [j15]Francis J. Vasko, Rachel Wisemiller, Patrick Gorman:
A women's collegiate basketball star player helps her team with OR. OR Insight 23(2): 71-81 (2010)
2000 – 2009
- 2009
- [j14]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): 829-838 (2009) - [j13]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): 45-53 (2009) - 2008
- [j12]Francis J. Vasko, Kenneth L. Stott Jr.:
Strategic Planning: OR to the Rescue. OR Insight 21(3): 26-32 (2008) - 2007
- [j11]Peter A. Huegler, Francis J. Vasko:
Metaheuristics for meltshop scheduling in the steel industry. J. Oper. Res. Soc. 58(6): 791-796 (2007) - 2005
- [j10]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): 235-243 (2005) - 2003
- [j9]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): 11-20 (2003) - 2002
- [j8]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): 441-458 (2002) - 2000
- [j7]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): 253-257 (2000)
1990 – 1999
- 1999
- [j6]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): 72-82 (1999) - [j5]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): 205-210 (1999) - 1995
- [j4]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): 82-84 (1995) - 1993
- [j3]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): 275-282 (1993)
1980 – 1989
- 1988
- [j2]Francis J. Vasko, Floyd E. Wolf:
Solving large set covering problems on a personal computer. Comput. Oper. Res. 15(2): 115-121 (1988) - 1987
- [j1]Francis J. Vasko, Floyd E. Wolf, Kenneth L. Stott Jr.:
Optimal Selection of Ingot Sizes Via Set Covering. Oper. Res. 35(3): 346-353 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
