Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions

1. Ahuja, R.K, Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall (1993)

   Google Scholar 

2. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer (1997)

   Google Scholar 

3. Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice—Closing the gap. In System Modelling and Optimization. Methods, Theory and Applications, eds. M.J.D. Powell and S. Scholtes. Kluwer (2000) 19–49

   Google Scholar 

4. Carvalho, F.D., Dellaert, N.P., Osório, M.D.: Statistical disclosure in twodimensional tables: general tables. J. Am. Stat. Assoc. 89 (1994) 1547–1557

   Article  MATH  Google Scholar 

5. Castro, J.: A specialized interior-point algorithm for multicommodity network flows. SIAM J. on Opt. 10 (2000) 852–877

   Article  MATH  Google Scholar 

6. Castro, J., Nabona, N. An implementation of linear and nonlinear multicommodity network flows. European Journal of Operational Research 92 (1996) 37–53

   Article  MATH  Google Scholar 

7. Cox, L.H.: Network models for complementary cell suppression. J. Am. Stat. Assoc. 90 (1995) 1453–1462

   Article  MATH  Google Scholar 

8. Dellaert, N.P., Luijten, W.A.: Statistical disclosure in general three-dimensional tables. Statistica Neerlandica 53 (1999) 197–221

   Article  MATH  MathSciNet  Google Scholar 

9. Fischetti, M., Salazar, J.J.: Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Prog. 84 (1999) 283–312

   MATH  MathSciNet  Google Scholar 

10. Fischetti, M., Salazar, J.J.: Models and algorithms for optimizing cell suppression in tabular data with linear constraints. J. Am. Stat. Assoc. 95 (2000) 916–928

    Article  Google Scholar 

11. Fischetti, M., Salazar, J.J.: Partial cell suppression: a new methodology for statistical disclosure control. Working paper, Department of Statistics, Operations Research and Computing, University of La Laguna (1998)

    Google Scholar 

12. Fourer, R, Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press (1993)

    Google Scholar 

13. Frangioni, A., Gallo, G: A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. on Comp. 11 (1999) 370–393

    Article  MATH  MathSciNet  Google Scholar 

14. Giessing, S.: New tools for cell-suppression in π-Argus: one piece of the CASC project work draft. Joint ECE/Eurostat Work Session on Statistical Data Confidentiality, Skopje (2001).

    Google Scholar 

15. Goldberg, A.V., Oldham, J.D., Plotkin, S., Stein, C.: An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. In Lecture Notes in Computer Sciences. Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference, eds. R.E. Bixby, E.A. Boyd and R.Z. Ríos-Mercado. Springer (1998)

    Google Scholar 

16. Gondzio, J, Sarkissian, R.: Parallel interior-point solver for structured linear programs. Technical Report MS-00-025, Department of Mathematics and Statistics, The University of Edinburgh (2000)

    Google Scholar 

17. ILOG CPLEX: ILOG CPLEX 6.5 Reference Manual Library. ILOG (1999)

    Google Scholar 

18. Jewett, R.: Disclosure analysis for the 1992 Economic Census. Manuscript, Economic Programming Division, Bureau of the Census (1993)

    Google Scholar 

19. Kelly, J.P., Golden, B.L, Assad, A.A.: Cell Suppression: disclosure protection for sensitive tabular data. Networks 22 (1992) 28–55

    Article  Google Scholar 

20. Massell, P.B.: Cell suppression and audit programs used for economic magnitude data. SRD Research Report Series RR2001/01 (2001).

    Google Scholar 

21. Robertson, D.: Improving Statistic’s Canada cell suppression software (CONFID). Proceedings of Compstat 2000.

    Google Scholar 

Download references