Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming (Q931381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming |
scientific article; zbMATH DE number 5292833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming |
scientific article; zbMATH DE number 5292833 |
Statements
Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming (English)
0 references
25 June 2008
0 references
linear integer programming
0 references
numerical examples
0 references
Boltzmann distribution
0 references
combinatorial optimization
0 references
counting problems
0 references
Monte Carlo simulation
0 references
generic minimum cross-entropy method
0 references
rare-event probability estimation
0 references
variance minimization
0 references
0 references
