The controlled rounding problem: Complexity and computational experience

DOI10.1016/0377-2217(93)90334-JzbMath0777.62012OpenAlexW2049091849MaRDI QIDQ1261381

Arjang A. Assad, James P. Kelly, Bruce L. Golden

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

heuristicssimulated annealingcensoringanonymitydata integritygovernmentstatistical disclosurecontrolled roundingagenciesbinary search procedurescensus organizationsstatistical enclosuretree-dimensional problemtwo- dimensional tables

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Controlled rounding for tables with subtotals
• The edge-coloring of complete hypergraphs. I
• The controlled rounding problem: Relaxations and complexity issues
• Large-scale controlled rounding using tabu search with strategic oscillation
• Controlled Rounding of Tabular Data
• A Graph Theoretic Approach to Statistical Data Security
• A Constructive Procedure for Unbiased Controlled Rounding
• Simulated Annealing – An Annotated Bibliography
• Controlled Rounding
• Using Simulated Annealing to Solve Controlled Rounding Problems
• On the Question of Statistical Confidentiality