Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer Jul 1998

Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer

Mathematical Sciences Technical Reports (MSTR)

This paper is concerned with finding two solutions of a set covering problem that have a minimum number of variables in common. We show that this problem is NP­ complete, even in the case where we are only interested in completely disjoint solutions. We describe three heuristic methods based on the standard greedy algorithm for set covering problems. Two of these algorithms find the solutions sequentially, while the third finds them simultaneously. A local search method for reducing the overlap of the two given solutions is then described. This method involves the solution of a reduced set covering problem. Finally, …


A New Sequential Goodness Of Fit Test For The Three-Parameter Weibull Distribution With Known Shape Based On Skewness And Kurtosis, Jonathan C. Clough Mar 1998

A New Sequential Goodness Of Fit Test For The Three-Parameter Weibull Distribution With Known Shape Based On Skewness And Kurtosis, Jonathan C. Clough

Theses and Dissertations

The Weibull distribution finds wide applicability across a broad spectrum of disciplines and is very prevalent in reliability theory. Consequently, numerous statistical tests have been developed to determine whether sample data can be adequately modeled with this distribution. Unfortunately, the majority of these goodness-of-fit tests involve a substantial degree of computational complexity. The study presented here develops and evaluates a new sequential goodness-of-fit test for the three-parameter Weibull distribution with a known shape that delivers power comparable to popular procedures while dramatically reducing computational requirements. The new procedure consists of two distinct tests, using only the sample skewness and sample …


Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad Mar 1998

Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad

Theses and Dissertations

An instance of the geometric knapsack problem occurs in air lift loading where a set of cargo must be chosen to pack in a given fleet of aircraft. This paper demonstrates a new heuristic to solve this problem in a reasonable amount of time with a higher quality solution then previously reported in literature. We also report a new tabu search heuristic to solve geometric knapsack problems.


Mass Transfer With Chemical Reaction In The Process Of Ammonia Desorption From Aqueous Solutions Containing Carbon Dioxide, Wojciech M. Budzianowski Jan 1998

Mass Transfer With Chemical Reaction In The Process Of Ammonia Desorption From Aqueous Solutions Containing Carbon Dioxide, Wojciech M. Budzianowski

Wojciech Budzianowski

No abstract provided.