Preemptive benchmarking problem: An approach for official statistics in small areas
From MaRDI portal
Publication:2378486
DOI10.1016/J.EJOR.2008.02.032zbMATH Open1165.90032OpenAlexW2026387993MaRDI QIDQ2378486FDOQ2378486
Authors: Yanyan Li
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.02.032
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- Some new developments in small area estimation
- Generalized Raking Procedures in Survey Sampling
- 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)
- Title not available (Why is that?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- Computational investigations of maximum flow algorithms
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Minimum-distance controlled perturbation methods for large-scale tabular data protection
- Contingency tables with given marginals
- A polynomial algorithm for minimum quadratic cost flow problems
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- Solving the undirected minimum cost flow problem with arbitrary costs
Cited In (1)
Uses Software
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)