zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Conditional covering: Greedy heuristics and computational results. (English) Zbl 0622.90060
The conditional covering problem is a variation of the set-covering problem which seeks a minimum set of facility sites that will cover not only the given demand points but also one another. Finding an exact solution to the problem is difficult and costly. This paper presents seven greedy heuristics with computational results. Compared with exact integer solutions obtained from LINDO, most of these heuristics seem to perform quite satisfactorily for relatively large problems. The paper also discusses worst-case error bounds for the two best performing heuristics based on the best known bound for set-covering.
MSC:
90C10Integer programming
90B05Inventory, storage, reservoirs
65K05Mathematical programming (numerical methods)
68Q25Analysis of algorithms and problem complexity
05C70Factorization, etc.
90C90Applications of mathematical programming