A simulated annealing-based algorithm for selecting balanced samples
From MaRDI portal
Publication:2135874
Recommendations
Cites work
- A comparison of pivotal sampling and unequal probability sampling with replacement
- A fast algorithm for balanced sampling
- A Generalization of Sampling Without Replacement From a Finite Universe
- A spatially balanced design with probability function proportional to the within sample distance
- Doubly balanced spatial sampling with spreading and restitution of auxiliary totals
- Efficient balanced sampling: The cube method
- scientific article; zbMATH DE number 3986503 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3778516 (Why is no real title available?)
- scientific article; zbMATH DE number 1547331 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Inference under pivotal sampling: Properties, variance estimation, and application to tesselation for spatial sampling
- Optimization by simulated annealing
- Sampling algorithms.
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Unequal probability sampling without replacement through a splitting method
Cited in
(3)
This page was built for publication: A simulated annealing-based algorithm for selecting balanced samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2135874)