We study the generalized min sum set cover (GMSSC) problem, wherein given a collection
of hyperedges E with arbitrary covering requirements {ke∊ Z+: e∊ E}, the goal is to find an …

In this study, we consider the classical online scheduling problem with rejection on identical
parallel machines. In particular, a series of independent jobs arriving online over time will be …

We consider a search problem in which one or more targets must be rescued by a search
party, or Searcher. The targets may be survivors of some natural disaster, or prisoners held …

This paper provides a review of recent results on machine scheduling problems solved by
methods of submodular optimization. We present some basic definitions of submodular …

We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding
locations to find multiple items hidden by a hider. Each hiding location has a maximum …

We study the Generalized Min Sum Set Cover (GMSSC) problem, wherein given a collection
of hyperedges with arbitrary covering requirements, the goal is to find an ordering of the …

We consider a large family of problems in which an ordering (or, more precisely, a chain of
subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family …

Due to privacy concerns of users and law enforcement in data security and privacy, it
becomes more and more difficult to share data among organizations. Data federation brings …

We present efficient algorithms for computing optimal or approximately optimal strategies in
a zero-sum game for which player I has n pure strategies and player II has an arbitrary …

Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a
known probability distribution. Starting from a fixed root node, an expanding search visits the …