Solving the Cell Suppression Problem on tabular data with linear constraints

Management Science

Volumn 47, Issue 7, 2001, Pages 1008-1027

  Fischetti, Matteo ^a,b   Salazar, Juan José ^a,b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Branch and Cut Algorithms; Cell Suppression; Confidentiality; Integer Linear Programming; Statistical Disclosure Control; Tabular Data

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; SECURITY OF DATA; STATISTICAL METHODS;

CELL SUPPRESSION PROBLEM; LINEAR CONSTRAINTS;

MANAGEMENT SCIENCE;

EID: 0035410523     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.47.7.1008.9805     Document Type: Article

References (19)

1. Finding cuts in the traveling salesman problem
2. Branch-and-cut algorithms
3. Suppression methodology and statistical disclosure control
4. Network models for complementary cell suppression
5. Solving large-scale zero-one linear programming problems
6. Statistical disclosure in two-dimensional tables: General tables
7. Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
8. A graph theoretic approach to statistical data security
9. Data security equals graph connectivity
10. Cell suppression: Disclosure protection for sensitive tabular data
11. A branch-and-cut algotithm for the resolution of large-scale symmetric traveling salesman problems
12. Cell suppression at statistics Canada
13. Automated cell suppression to preserve confidentiality of business statistics
14. Statistical disclosure control in practice