Solving the Cell Suppression Problem on Tabular Data with Linear Constraints

References

  • Applegate D., Bixby R., Cook W., Chvátal V.Finding cuts in the traveling salesman problem (1995) (Center for Research on Parallel Computation, Rice University, Houston, TX) . DIMACS technical report 95-05Google Scholar
  • Caprara A., Fischetti M., Dell'Amico M., Maffioli F., Martello S. Branch-and-cut algorithms. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons)Google Scholar
  • Cox L. H. Suppression methodology and statistical disclosure control. J. Amer. Statist. Assoc. (1980) 75:377–385CrossrefGoogle Scholar
  • Cox L. H. Network models for complementary cell suppression. J. Amer. Statist. Assoc. (1995) 90:1453–1462CrossrefGoogle Scholar
  • Crowder H. P., Johnson E. L., Padberg M. W. Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834LinkGoogle Scholar
  • Carvalho F. D., Dellaert N. P., Osório M. S. Statistical disclosure in two-dimensional tables: General tables. J. Amer. Statist. Assoc. (1994) 89:1547–1557CrossrefGoogle Scholar
  • Dellaert N. P., Luijten W. A.Statistical disclosure in general three-dimensional tables (1996) (Tinbergen Institute, Rotterdam, The Netherlands) . Technical paper TI 96-114/9Google Scholar
  • Fischetti M., Salazar J. J. Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Programming (1999) 84:283–312CrossrefGoogle Scholar
  • Geurts J.Heuristics for cell suppression in tables (1992) (Netherlands Central Bureau of Statistics, Voorburg, The Netherlands) . Working paperGoogle Scholar
  • Gusfield D. A graph theoretic approach to statistical data security. SIAM J. Comput. (1988) 17:552–571CrossrefGoogle Scholar
  • Kao M. Y. Data security equals graph connectivity. SIAM J. Discrete Math. (1996) 9:87–100CrossrefGoogle Scholar
  • Kelly J. P.Confidentiality protection in two- and three-dimensional tables (1990) (University of Maryland, College Park, MD) . Ph.D. dissertationGoogle Scholar
  • Kelly J. P., Golden B. L., Assad A. A. Cell suppression: Disclosure protection for sensitive tabular data. Networks (1992) 22:397–417CrossrefGoogle Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and combinatorial optimization (1988) (John Wiley & Sons)CrossrefGoogle Scholar
  • Padberg M., Rinaldi G. A branch-and-cut algotithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100CrossrefGoogle Scholar
  • Robertson D. A. Cell suppression at Statistics Canada. (1995) Proc. Second Internat. Conf. Statist. Confidentiality(Luxembourg)Google Scholar
  • Sande G. Automated cell suppression to preserve confiden-tiality of business statistics. Statist. J. United Nations ECE (1984) 2:33–41Google Scholar
  • Sande G.Blunders official statitical agencies make while protecting the confidentiality of business statistics (1998) (Sande and Associates). Internal reportGoogle Scholar
  • Willenborg L. C. R. J., de Waal T. Statistical disclosure control in practice. Lecture Notes in Statistics 111 (1996) (Springer, New York)CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.