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

Authors:
Jordi Castro
Affiliations:
-
Venue:
Inference Control in Statistical Databases, From Theory to Practice
Year:
2002

Citing 5
Cited 5

A Specialized Interior-Point Algorithm for Multicommodity Network Flows

SIAM Journal on Optimization
Partial cell suppression: A new methodology for statistical disclosure control

Statistics and Computing
MIP: Theory and Practice - Closing the Gap

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems

INFORMS Journal on Computing
Introduction to Stochastic Programming

Introduction to Stochastic Programming

Statistical confidentiality: Optimization techniques to protect tables

Computers and Operations Research
Scaling up a hybrid genetic linear programming algorithm for statistical disclosure control

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Automatic structure detection in constraints of tabular data

PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Initial application of ant colony optimisation to statistical disclosure control

Proceedings of the 15th annual conference on Genetic and evolutionary computation
A preprocessing optimization applied to the cell suppression problem in statistical disclosure control

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.