Results 91 to 100 of about 2,347,375 (169)

Bernstein sets and $\kappa$-coverings

open access: yes, 2010
In this paper we study a notion of a $\kappa$-covering in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel and Nowik. We consider also other types of coverings.
Kraszewski, Jan   +3 more
openaire   +2 more sources

Minimal logical constraint covering sets

open access: yes, 2006
We propose a general framework for computing minimal set covers under class of certain logical constraints. The underlying idea is to transform the problem into a mathematical programm under linear constraints. In this sense it can be seen as a natural extension of the vector quantization algorithm proposed by [5].
Sinz, F., Schölkopf, B.
openaire   +2 more sources

Online Set Cover with Set Requests

open access: yes, 2014
We consider a generic online allocation problem that generalizes the classical online set cover framework by considering requests comprising a set of elements rather than a single element. This problem has multiple applications in cloud computing, crowd sourcing, facility planning, etc.
Bhawalkar, Kshipra   +2 more
openaire   +2 more sources

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

open access: yesDiscrete Appl Math, 2014
Cacchiani V, Hemmelmayr VC, Tricoire F.
europepmc   +1 more source

Home - About - Disclaimer - Privacy