Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control

DOI10.1007/s10107980022azbMath0971.90053OpenAlexW162880586MaRDI QIDQ1572678

Matteo Fischetti, Juan José Salazar

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107980022a

zbMATH Keywords

branch-and-cutstatistical disclosure controlcell suppression

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (10)

An algorithm for the microaggregation problem using column generation ⋮ Obtaining cell counts for contingency tables from rounded conditional frequencies ⋮ Rapid calculation of exact cell bounds for contingency tables from conditional frequencies ⋮ 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 ⋮ Max-multiflow/min-multicut for G+H series-parallel ⋮ Exact disclosure prevention in two-dimensional statistical tables ⋮ Minimum-distance controlled perturbation methods for large-scale tabular data protection

This page was built for publication: Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control