Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
From MaRDI portal
Publication:1663138
DOI10.1016/j.csda.2015.06.003zbMath1468.62056OpenAlexW1191922761MaRDI QIDQ1663138
Ulf Friedrich, Sven de Vries, Ralf T. Münnich, Matthias Wagner
Publication date: 21 August 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2015.06.003
box constraintsgreedy algorithmoptimal allocationpolymatroidnonlinear discrete optimizationGerman Census 2011
Computational methods for problems pertaining to statistics (62-08) Sampling theory, sample surveys (62D05)
Related Items
On a Reduction for a Class of Resource Allocation Problems, Neyman-type sample allocation for domains-efficient estimation in multistage sampling, An index tracking model with stratified sampling and optimal allocation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal allocation of the sample size to strata under box constraints
- Struggles with survey weighting and regression modeling
- On stochastic optimization in sample allocation among strata
- A biobjective method for sample allocation in stratified sampling
- Optimum allocation in stratified surveys: stochastic programming
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- An application of mathematical programming to sample allocation
- Model assisted survey sampling.
- Nonlinear integer programming for optimal allocation in stratified sampling
- Numerical solution of optimal allocation problems in stratified sampling under box constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A nonlinear knapsack problem
- Modelling over and undercounts for design-based Monte Carlo studies in small area estimation: an application to the German register-assisted census
- A survey on the continuous nonlinear resource allocation problem
- Combining random sampling and census strategies -- Justification of inclusion probabilities equal to 1
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- The Optimum Distribution of Effort
- On an Allocation Problem with Multistage Constraints
- A Problem in Optimum Allocation
