The controlled rounding problem: Complexity and computational experience

DOI10.1016/0377-2217(93)90334-JMaRDI QIDQ1261381zbMATH OpenOpenAlexFDO

Authors James Kelly, Bruce Golden, Arjang A. Assad

Publication date 28 September 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(93)90334-j

zbMATH Keywords

agenciesanonymitybinary search procedurescensoringcensus organizationscontrolled roundingdata integritygovernmentheuristicssimulated annealingstatistical disclosurestatistical enclosuretree-dimensional problemtwo- dimensional tables

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Applications of statistics (62P99) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)

Recommendations

• A rounding algorithm for integer programs
• scientific article; zbMATH DE number 1617281
• Rounding algorithms for covering problems
• Rounding of Polytopes in the Real Number Model of Computation
• scientific article; zbMATH DE number 1882421
• A Constructive Procedure for Unbiased Controlled Rounding
• Bounds on the objective value of feasible roundings
• On a generalization of iterated and randomized rounding
• scientific article; zbMATH DE number 794391

Cites work

• A Constructive Procedure for Unbiased Controlled Rounding
• A Graph Theoretic Approach to Statistical Data Security
• Controlled Rounding
• Controlled rounding for tables with subtotals
• Controlled Rounding of Tabular Data
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Large-scale controlled rounding using tabu search with strategic oscillation
• On the Question of Statistical Confidentiality
• Simulated Annealing – An Annotated Bibliography
• The controlled rounding problem: Relaxations and complexity issues
• The edge-coloring of complete hypergraphs. I
• Using Simulated Annealing to Solve Controlled Rounding Problems

Cited in

(6)

• Confidentiality control of tabulated data: Some practical network models
• Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data
• A Constructive Procedure for Unbiased Controlled Rounding
• Using Simulated Annealing to Solve Controlled Rounding Problems
• scientific article; zbMATH DE number 1131704 (Why is no real title available?)
• Controlled rounding for tables with subtotals

This page was built for publication: The controlled rounding problem: Complexity and computational experience

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