Learn More
Given a set S={S,...,S} of finite strings, the k-Longest Common Subsequence Problem (k-LCSP) seeks a string L* of maximum length such that L* is a subsequence of each S for i=1,...,k. This paper presents a large neighborhood search technique that provides quality solutions to large k-LCSP instances. This heuristic runs in linear time in both the length of(More)
Cover inequalities are commonly used cutting planes for the 0–1 knapsack problem. This paper describes a linear-time algorithm (assuming the knapsack is sorted) to simultaneously lift a set of variables into a cover inequality. Conditions for this process to result in valid and facet-defining inequalities are presented. In many instances, the resulting(More)
The study of epidemics is a crucial issue to several areas. An epidemic can have devastating economic and social consequences. A single crop disease in Kansas could destroy the yearly income of many farmers. Previous work using graph theory has determined a universal epidemic threshold found in the graph topology for a binary contact network in the(More)
Containing an epidemic at its origin is the most desirable mitigation. Epidemics have often originated in rural areas, with rural communities among the first affected. Disease dynamics in rural regions have received limited attention, and results of general studies cannot be directly applied since population densities and human mobility factors are very(More)