Search Results - "Vasko, Francis J."

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

“…This paper provides comprehensive empirical and analytical evidence of the impact of choice constraints on two important categories of knapsack problems by…”
Get full text

Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners by Dellinger, Anthony, Lu, Yun, Song, Myung Soon, Vasko, Francis J.

“…The multiple‐choice multi‐dimensional knapsack problem (MMKP) is an NP‐hard generalization of the classic 0–1 knapsack problem. The MMKP has a variety of…”
Get full text

An OR practitioner’s solution approach to the multidimensional knapsack problem by Kern, Zachary, Lu, Yun, Vasko, Francis J.

“…The 0-1 Multidimensional Knapsack Problem (MKP) is an NP-Hard problem that has many important applications in business and industry. However, business and…”
Get full text

Probability & Perception: The Representativeness Heuristic in Action by Lu, Yun, Vasko, Francis J, Drummond, Trevor J, Vasko, Lisa E

“…Events that seem more representative may be judged more probable, so experiments and proof are needed to help students analyze a mathematical outcome…”
Get full text

What is the best greedy-like heuristic for the weighted set covering problem? by Vasko, Francis J., Lu, Yun, Zyma, Kenneth

“…The greedy heuristic for the weighted set covering problem is a “column knowledge” construction heuristic where cost and row coverage information are used to…”
Get full text

A simple and efficient strategy for solving very large-scale generalized cable-trench problems by Vasko, Francis J., Landquist, Eric, Kresge, Gregory, Tal, Adam, Jiang, Yifeng, Papademetris, Xenophon

“…Vasko et al., Comput Oper Res 29 (2002), 441–458 defined the cable‐trench problem (CTP) as a combination of the Shortest Path and Minimum Spanning Tree…”
Get full text

Formulating and solving a radio astronomy antenna connection problem as a generalized cable‐trench problem: an empirical study by Zyma, Kenneth, Girard, Julien N., Landquist, Eric, Schaper, Gregory, Vasko, Francis J.

“…The low‐frequency array, LOFAR, is the world's largest connected low‐frequency (LF) radio telescope, combining antenna arrays from across Western Europe into a…”
Get full text

Ask Marilyn in the mathematics classroom: probability questions by Vasko, Francis J.

“…Since 1986, Marilyn Vos Savant, who is listed in the Guinness Book of World Records Hall of Fame for the highest IQ, has had a weekly column that is published…”
Get full text

Using an interval graph approach to efficiently solve the housing benefit data retrieval problem by Vasko, Francis J., Kunkel, Jeffrey D., Gorman, Patrick

“…Rappos and Thompson use a set covering formulation and a commercial software package to solve the problem of trying to minimize the number of data sets that…”
Get full text

Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems by Vasko, Francis J., Bartkowski, Christopher L.

“…P. Y. Wang's classic bottom‐up two‐dimensional cutting stock algorithm generates cutting patterns by building rectangles both horizontally and vertically. This…”
Get full text

Using Pinochle to motivate the restricted combinations with repetitions problem by Gorman, Patrick S., Kunkel, Jeffrey D., Vasko, Francis J.

“…A standard example used in introductory combinatoric courses is to count the number of five-card poker hands possible from a straight deck of 52 distinct…”
Get full text

Statistical analyses of solution methods for the multiple-choice knapsack problem with setups: Implications for OR practitioners by Song, Myung Soon, Lu, Yun, Rando, Dominic, Vasko, Francis J.

“…•MCKS instances are efficiently solved using Gurobi.•Gurobi generated guaranteed near-optimum by using a sequential strategy.•Gurobi results for the MCKS are…”
Get full text

Consolidating Product Sizes to Minimize Inventory Levels for a Multi-Stage Production and Distribution System by Newhart, Dennis D., Stott, Kenneth L., Vasko, Francis J.

“…The optimal design of a supply chain was approached in two phases by using: (1) a mathematical programming formulation and heuristic solution approach to…”
Get full text

Can Teachers Trust the World Wide Web for Classroom Lesson Plans? by Vasko, Francis J, Peterson, Winnie J

“…Standards challenge educators on a regular basis to integrate technology into their content and methods courses. Students today access the Internet which in…”
Get full text

When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners by Song, Myung Soon, Emerick, Brooks, Lu, Yun, Vasko, Francis J.

“…An important generalization of the classic 0-1 knapsack problem is the multi-demand multidimensional knapsack problem (MDMKP). In addition to being…”
Get full text

The cable trench problem: combining the shortest path and minimum spanning tree problems by Vasko, Francis J., Barbieri, Robert S., Rieksts, Brian Q., Reitmeyer, Kenneth L., Stott, Kenneth L.

“…Let G=( V, E) be a connected graph with specified vertex v 0∈ V, length l( e)⩾0 for each e∈ E, and positive parameters τ and γ. The cable-trench problem (CTP)…”
Get full text

A practical approach for dealing with hard knapsack problems using general‐purpose integer programming software by Song, Myung Soon, Lin, Pei Hua, Lu, Yun, Shively‐Ertas, Emre, Vasko, Francis J.

“…Several articles dealing with the generation of hard 0‐1 knapsack problems (KPs) have given rise to 13,940 KP instances being made available for empirical…”
Get full text

A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading by Vasko, Francis J, Newhart, Dennis D, Stott, Jr, Kenneth L

“…In the steel industry, as hot steel products exit the producing facility, they are cut at primary saws (hotsaws) into shorter pieces. After these pieces cool,…”
Get full text

A performance comparison of heuristics for the total weighted tardiness problem by Huegler, Peter A., Vasko, Francis J.

“…The single machine total weighted tardiness problem is an NP-hard problem that requires the use of heuristic solution procedures when more than 50 jobs are to…”
Get full text

Using a Facility Location Algorithm to Determine Optimum Cast Bloom Lengths by Vasko, Francis J., Newhart, Dennis D., Stott, Kenneth L., Wolf, Floyd E.

“…The dimensions of a bloom, which is a rectangular piece of steel, are critical for efficiently and effectively rolling the bloom into a finished structural…”
Get full text