Solving the Cell Suppression Problem on Tabular Data with Linear Constraints

DOI10.1287/mnsc.47.7.1008.9805zbMath1232.90308OpenAlexW2009233040MaRDI QIDQ3114715

Matteo Fischetti, Juan José Salazar

Publication date: 19 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.47.7.1008.9805

zbMATH Keywords

integer linear programmingtabular databranch-and-cut algorithmsstatistical disclosurecell suppressioncontrol confidentiality

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (10)

An algorithm for the microaggregation problem using column generation ⋮ Fix-and-relax approaches for controlled tabular adjustment ⋮ Perspective Reformulations of the CTA Problem with L₂ Distances ⋮ Recent advances in optimization techniques for statistical tabular data protection ⋮ Mathematical models for applying cell suppression methodology in statistical data protection. ⋮ Cell suppression problem: A genetic-based approach ⋮ Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection ⋮ Estimating suppressed data in regional economic databases: A goal-programming approach ⋮ Minimum-distance controlled perturbation methods for large-scale tabular data protection ⋮ Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

This page was built for publication: Solving the Cell Suppression Problem on Tabular Data with Linear Constraints