Rounding with multiplier methods: An efficient algorithm and applications in statistics

DOI10.1007/BF02925514zbMATH Open0931.65050MaRDI QIDQ1290857FDOQ1290857

Thomas Klein, Gregor Dorfleitner

Publication date: 14 February 2000

Published in: Statistical Papers (Search for Journal in Brave)

zbMATH Keywords

multiplier rounding methodsrounding percentagesrounding with summation restrictionsignpost sequence

Mathematics Subject Classification ID

Applications of statistics (62P99) Roundoff error (65G50)

Cites Work

• On Rounding Percentages
• Efficient rounding of sampling allocations
• Rounding probabilities: Maximum probability and minimum complexity multipliers
• Rounding Proportions:Rules of Rounding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Surface volumes of rounding polytopes
• Rounding probabilities: Maximum probability and minimum complexity multipliers
• Evaluation of thresholds for power mean-based and other divisor methods of apportionment
• Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
• Asymptotic equivalence of seat bias models
• A generalized parametric divisor method for political apportionment
• Linear-Time Algorithms for Proportional Apportionment
• Vector and matrix apportionment problems and separable convex integer optimization
• Optimal time plan in accelerated degradation testing
• A simple and fast linear-time algorithm for divisor methods of apportionment

This page was built for publication: Rounding with multiplier methods: An efficient algorithm and applications in statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290857)