A new approach to round tabular data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4302, Issue , 2006, Pages 25-34

  Salazar González, Juan Joś ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL RESULTS; CONTROLLED ROUNDING; FEASIBLE SOLUTION; NEW APPROACHES; TABULAR DATA;

ARTIFICIAL INTELLIGENCE;

EID: 84958948527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11930242_3     Document Type: Conference Paper

References (11)

1. M. Bacharach. Matrix rounding problem. Management Science, 9:732–742, 1966.
2. B. D. Causey, L. H. Cox, and L. R. Ernst. Applications of transportation theory to statistical problems. Journal of the American Statistical Association, 80:903–909, 1985.
3. L. H. Cox. Controlled rounding. INFOR, 20:423–432, 1982.
4. L. H. Cox. A constructive procedure for unbiased controlled rounding. Journal of the American Statistical Association, 82:520–524, 1987.
5. L.H. Cox and J.A. George. Controlled rounding for tables with subtotals. Annals of Operations Research, pages 141–157, 1989.
6. T. Dalenius. A simple procedure for controlled rounding. Statistisk Tidskrift, 3:202–208, 1981.
7. J.T. Fagan, B.V. Greenberg, and R. Hemmig. Controlled rounding of three dimensional tables. Technical report, Bureau of the Census, SRD/RR-88/02, 1988.
8. I. P. Fellegi. Controlled random rounding. Survey Methodology, pages 123–133, 1975.
9. J. Moravek and M. Vlach. On necessary conditions for the existence of the solution to the multi-index transportation problem. Operations Research, pages 542–545, 1967.
10. J. J. Salazar. A unified mathematical programming framework for different statistical disclosure limitation methods. Operations Research, 53(3):819–829, 2005.
11. J. J. Salazar. Controlled rounding and cell perturbation: Statistical disclosure limitation methods for tabular data. Mathematical Programming, 105(2–3):251–274, 2006.