Tight bounds for capacities

DOI10.1016/0898-1221(94)90067-1zbMath0798.90119OpenAlexW1973061861MaRDI QIDQ1323610

Thomas Kämpke

Publication date: 1 June 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90067-1

zbMATH Keywords

data compressionMöbius inversiondisjunctive programmingChoquet capacitiescompatible distributionsdeviation property

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• An algorithm for disjunctive programs
• Submodular functions and optimization
• Lower probabilities and function representation
• Minimax tests and the Neyman-Pearson lemma for capacities
• Theory of capacities
• On L1 and Chebyshev estimation
• Parametric approach to a class of nonconvex global optimization problems
• Disjunctive Programming
• Upper and Lower Probabilities Induced by a Multivalued Mapping

This page was built for publication: Tight bounds for capacities