The splitting method for decision making
From MaRDI portal
Recommendations
- Counting with combined splitting and capture--recapture methods
- On the use of smoothing to improve the performance of the splitting method
- A note on splitting of variables in integer programming models
- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
- How to generate uniform samples on discrete sets using the splitting method
Cites work
- A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
- scientific article; zbMATH DE number 5070674 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
- Rare events, splitting, and quasi-Monte Carlo
- Simulation and the Monte Carlo Method
- Stochastic simulation: Algorithms and analysis
- The cross-entropy method for combinatorial and continuous optimization
- The Gibbs cloner for combinatorial optimization, counting and sampling
Cited in
(8)- Rare event simulation and splitting for discontinuous random variables
- Sequential Monte Carlo for counting vertex covers in general graphs
- Making Decisions in Multi Partitioning
- On the use of smoothing to improve the performance of the splitting method
- Counting with combined splitting and capture--recapture methods
- Model counting of monotone conjunctive normal form formulas with spectra
- How to generate uniform samples on discrete sets using the splitting method
- Stochastic enumeration method for counting trees
This page was built for publication: The splitting method for decision making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905890)
