Solving the Cell Suppression Problem on Tabular Data with Linear Constraints
Published Online:1 Jul 2001https://doi.org/10.1287/mnsc.47.7.1008.9805
References
- Finding cuts in the traveling salesman problem (1995) (Center for Research on Parallel Computation, Rice University, Houston, TX) . DIMACS technical report 95-05Google Scholar
- , Dell'Amico M., Maffioli F., Martello S. Branch-and-cut algorithms. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons)Google Scholar
- Suppression methodology and statistical disclosure control. J. Amer. Statist. Assoc. (1980) 75:377–385Crossref, Google Scholar
- Network models for complementary cell suppression. J. Amer. Statist. Assoc. (1995) 90:1453–1462Crossref, Google Scholar
- Solving large-scale zero-one linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
- Statistical disclosure in two-dimensional tables: General tables. J. Amer. Statist. Assoc. (1994) 89:1547–1557Crossref, Google Scholar
- Statistical disclosure in general three-dimensional tables (1996) (Tinbergen Institute, Rotterdam, The Netherlands) . Technical paper TI 96-114/9Google Scholar
- Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Programming (1999) 84:283–312Crossref, Google Scholar
- Heuristics for cell suppression in tables (1992) (Netherlands Central Bureau of Statistics, Voorburg, The Netherlands) . Working paperGoogle Scholar
- A graph theoretic approach to statistical data security. SIAM J. Comput. (1988) 17:552–571Crossref, Google Scholar
- Data security equals graph connectivity. SIAM J. Discrete Math. (1996) 9:87–100Crossref, Google Scholar
- Confidentiality protection in two- and three-dimensional tables (1990) (University of Maryland, College Park, MD) . Ph.D. dissertationGoogle Scholar
- Cell suppression: Disclosure protection for sensitive tabular data. Networks (1992) 22:397–417Crossref, Google Scholar
- Integer and combinatorial optimization (1988) (John Wiley & Sons)Crossref, Google Scholar
- A branch-and-cut algotithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100Crossref, Google Scholar
- Cell suppression at Statistics Canada. (1995) Proc. Second Internat. Conf. Statist. Confidentiality(Luxembourg)Google Scholar
- Automated cell suppression to preserve confiden-tiality of business statistics. Statist. J. United Nations ECE (1984) 2:33–41Google Scholar
- Blunders official statitical agencies make while protecting the confidentiality of business statistics (1998) (Sande and Associates). Internal reportGoogle Scholar
- Statistical disclosure control in practice. Lecture Notes in Statistics 111 (1996) (Springer, New York)Crossref, Google Scholar

