Preemptive benchmarking problem: An approach for official statistics in small areas
From MaRDI portal
Publication:2378486
Recommendations
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A polynomial algorithm for minimum quadratic cost flow problems
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Computational investigations of maximum flow algorithms
- Contingency tables with given marginals
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Generalized Raking Procedures in Survey Sampling
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Minimum-distance controlled perturbation methods for large-scale tabular data protection
- Mixed model prediction and small area estimation. (With comments of P. Hall, D. Morales, C. N. Morris, J. N. K. Rao, and J. L. Eltinge)
- Network flows. Theory, algorithms, and applications.
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Solving the undirected minimum cost flow problem with arbitrary costs
- Some new developments in small area estimation
This page was built for publication: Preemptive benchmarking problem: An approach for official statistics in small areas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378486)