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 …

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 …

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 …

We consider a recently introduced class of network construction problems where edges of a
transportation network need to be constructed by a server (construction crew). The server …

This paper introduces a problem in which the state of a system needs to be determined
through costly tests of its components by a limited number of testing units and before a given …

Abstract We consider the Stochastic Boolean Function Evaluation (SBFE) problem where
the task is to efficiently evaluate a known Boolean function f on an unknown bit string x of …

The minimum linear ordering problem (MLOP) generalizes well-known combinatorial
optimization problems such as minimum linear arrangement and minimum sum set cover …

We consider the problem of solving the Min-Sum Submodular Cover problem using local
search. The Min-Sum Submodular Cover problem generalizes the NP-complete Min-Sum …

In network construction/restoration problems introduced in Averbakh and Pereira (IIE Trans
44 (8): 681–694, 2012; Eur J Oper Res 244: 715–729, 2015), a server (construction crew) …

We address various scheduling problems with OR-precedence constraints that are
extensions of min-sum set cover, minimum latency set cover and generalized min-sum set …