Models and algorithms for optimizing cell suppression in tabular data with linear constraints

Journal of the American Statistical Association

Volumn 95, Issue 451, 2000, Pages 916-928

  Fischetti, Matteo ^a   González, José Juan Salazar ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Confidentiality; Data protection; Integer linear programming; Polyhedral combinatorics; Statistical disclosure control

Indexed keywords

EID: 2242454277     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.2000.10474282     Document Type: Article

References (19)

1. Applegate, D., Bixby, R., Cook, W., and Chvatal, V. (1998), “CRPC Researchers Solve Traveling Salesman Problem for Record-Breaking 13,509 Cities,” Internal Report, Rice University, Center for Research on Parallel Computation.
2. Caprara, A., and Fischetti, M. (1997), “Branch-and-Cut Algorithms,” in Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell’Amico, F. Maffioli, and S. Martello, New York: Wiley.
3. Cox, L. H. (1980), “Suppression Methodology and Statistical Disclosure Control,” Journal of the American Statistical Association, 75, 377-385.
4. Cox, L. H. (1995), “Network Models for Complementary Cell Suppression,” Journal of the American Statistical Association, 90, 1453-1462.
5. Crowder, H. P.; Johnson, E. L., and Padberg, M. W. (1983), “Solving Large-Scale Zero-One Linear Programming Problems,” Operations Research, 31, 803-834.
6. Carvalho, F. D., Dellaert, N. P., and Osorio, M. S. (1994), “Statistical Disclosure in Two-Dimensional Tables: General Tables,” Journal of the American Statistical Association, 89, 1547-1557.
7. Dellaert, N. P., and Luijten, W. A. (1996), “Statistical Disclosure in General Three-Dimensional Tables,” Technical Paper TI 96-114/9, Tinbergen Institute.
8. Fischetti, M., and Salazar, J. J. (1998), “Models and Algorithms for Cell Suppression in Tabular Data With Linear Constraints,” technical paper, University of La Laguna; available at webpages.ull.es/users/jjsalaza.
9. Fischetti, M., and Salazar, J. J. (1999), “Models and Algorithms for the 2-Dimensional Cell Suppression Problem in Statistical Disclosure Control,” Mathematical Programming, 84, 283-312.
10. Geurts, J. (1992), “Heuristics for Cell Suppression in Tables,” working paper, Netherlands Central Bureau of Statistics.
11. Gusfield, D. (1988), “A Graph Theoretic Approach to Statistical Data Security,” SIAM Journal on Computing, 17, 552-571.
12. Kao, M. Y. (1996), “Data Security Equals Graph Connectivity,” SIAM Journal on Discrete Mathematics, 9, 87-100.
13. Kelly, J. P. (1990), “Confidentiality Protection in Two- and ThreeDimensional Tables,” unpublished Ph.D. dissertation, University of Maryland.
14. Kelly, J. P., Golden, B. L., and Assad, A. A. (1992), “Cell Suppression: Disclosure Protection for Sensitive Tabular Data,” Networks, 22, 397-417.
15. Nemhauser, G. L., and Wolsey, L. A. (1988), Integer and Combinatorial Optimization, New York: Wiley.
16. Padberg, M., and Rinaldi, G. (1991), “A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems,” SIAM Reviews, 33, 60-100.
17. Robertson, D. A. (1994), “Cell Suppression at Statistics Canada,” in Proceedings of the Second International Conference on Statistical Confidentiality, Luxembourg.
18. Sande, G. (1984), “Automated Cell Suppression to Preserve Confidentiality of Business Statistics,” Statistical Journal of the United Nations ECE, 2, 33-41.
19. Willenborg, L. C. R. J., and de Waal, T. (1996), Statistical Disclosure Control in Practice (Lecture Notes in Statistics 11), New York: Springer.