Entropy and set covering
From MaRDI portal
Publication:1092816
DOI10.1016/0020-0255(85)90058-1zbMath0627.90071OpenAlexW2094640442MaRDI 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 coveringset representationleast-cost set coveringmaximum joint probability problemweighted cross entropy
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Measures of information, entropy (94A17)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item