Entropy and set covering
From MaRDI portal
Publication:1092816
DOI10.1016/0020-0255(85)90058-1zbMath0627.90071MaRDI QIDQ1092816
Publication date: 1985
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(85)90058-1
minimum covering; set representation; least-cost set covering; maximum joint probability problem; weighted cross entropy
90C10: Integer programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
90C09: Boolean programming
94A17: Measures of information, entropy
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional clusters, musters, and probability
- Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz.
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Greedy Heuristic for the Set-Covering Problem
- Entropy in linear programs
- The Sequential Covering Problem Under Uncertainty