Skip to main content

Using a Mathematical Programming Modeling Language for Optimal CTA

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5262))

Abstract

Minimum-distance controlled tabular adjustment methods (CTA) have been formulated as an alternative to the cell suppression problem (CSP) for tabular data. CTA formulates an optimization problem with fewer variables and constraints than CSP. However, the inclusion of binary decisions about protection sense of sensitive cells (optimal CTA) in the formulation, still results in a mixed integer-linear problem. This work shows how mathematical programming modeling languages can be used to develop a prototype for optimal CTA based on Benders method. Preliminary results are reported for some medium size two-dimensional tables. For this type of tables, the approach is competitive with other general-purpose algorithms implemented in commercial solvers.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Computational Management Science 2, 3–19 (2005); English translation of the original paper appeared in Numerische Mathematik 4, 238–252 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  2. Castro, J.: Minimum-distance controlled perturbation methods for large-scale tabular data protection. European Journal of Operational Research 171, 39–52 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Castro, J.: A shortest paths heuristic for statistical disclosure control in positive tables. INFORMS Journal on Computing 19, 520–533 (2007)

    Article  Google Scholar 

  4. Castro, J., Giessing, S.: Testing variants of minimum distance controlled tabular adjustment. In: Monographs of Official Statistics, Eurostat-Office for Official Publications of the European Communities, Luxembourg, pp. 333–343 (2006)

    Google Scholar 

  5. Castro, J., González, J.A.: A Benders decomposition approach to CTA, working paper, Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya (2008)

    Google Scholar 

  6. Cox, L.H.: Confidentiality protection by CTA using metaheuristic methods. In: Monographs of Official Statistics, Eurostat-Office for Official Publications of the European Communities, Luxembourg, pp. 267–276 (2006)

    Google Scholar 

  7. Dandekar, R.A., Cox, L.H.: Synthetic tabular Data: an alternative to complementary cell suppression, manuscript, Energy Information Administration, U.S, Available from the first author on request (Ramesh.Dandekar@eia.doe.gov) (2002)

    Google Scholar 

  8. Fischetti, M., Salazar, J.J.: Solving the cell suppression problem on tabular data with linear constraints. Management Science 47, 1008–1026 (2001)

    Article  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Josep Domingo-Ferrer Yücel Saygın

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro, J., Baena, D. (2008). Using a Mathematical Programming Modeling Language for Optimal CTA. In: Domingo-Ferrer, J., Saygın, Y. (eds) Privacy in Statistical Databases. PSD 2008. Lecture Notes in Computer Science, vol 5262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87471-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87471-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87470-6

  • Online ISBN: 978-3-540-87471-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics