Abstract
Several network flows heuristics have been suggested in the past for the solution of the complementary suppression problem. However, a limited computational experience using them is reported in the literature, and, moreover, they were only appropriate for two-dimensional tables. The purpose of this paper is twofold. First, we perform an empirical comparison of two network flows heuristics. They are improved versions of already existing approaches. Second, we show that extensions of network flows methods (i.e., multicommodity network flows and network flows with side constraints) can model three-dimensional, hierarchical and linked tables. Exploiting this network structure can improve the performance of any solution method solely based on linear programming formulations.
Work supported by the IST-2000-25069 CASC project.
Author supported by CICYT Project TAP99-1075-C02-02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K, Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall (1993)
Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer (1997)
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
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
Castro, J.: A specialized interior-point algorithm for multicommodity network flows. SIAM J. on Opt. 10 (2000) 852–877
Castro, J., Nabona, N. An implementation of linear and nonlinear multicommodity network flows. European Journal of Operational Research 92 (1996) 37–53
Cox, L.H.: Network models for complementary cell suppression. J. Am. Stat. Assoc. 90 (1995) 1453–1462
Dellaert, N.P., Luijten, W.A.: Statistical disclosure in general three-dimensional tables. Statistica Neerlandica 53 (1999) 197–221
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
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
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)
Fourer, R, Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press (1993)
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
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).
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)
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)
ILOG CPLEX: ILOG CPLEX 6.5 Reference Manual Library. ILOG (1999)
Jewett, R.: Disclosure analysis for the 1992 Economic Census. Manuscript, Economic Programming Division, Bureau of the Census (1993)
Kelly, J.P., Golden, B.L, Assad, A.A.: Cell Suppression: disclosure protection for sensitive tabular data. Networks 22 (1992) 28–55
Massell, P.B.: Cell suppression and audit programs used for economic magnitude data. SRD Research Report Series RR2001/01 (2001).
Robertson, D.: Improving Statistic’s Canada cell suppression software (CONFID). Proceedings of Compstat 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Castro, J. (2002). Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions. In: Domingo-Ferrer, J. (eds) Inference Control in Statistical Databases. Lecture Notes in Computer Science, vol 2316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47804-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-47804-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43614-0
Online ISBN: 978-3-540-47804-1
eBook Packages: Springer Book Archive