Using a stabilized Benders algorithm for cell suppression
Visualitza/Obre
SDC2019_S2_Catalonia_Baena-Castro-Frangioni.pdf (80,07Kb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/340511
Tipus de documentText en actes de congrés
Data publicació2019
EditorJohn Wiley & sons
Condicions d'accésAccés restringit per política de l'editorial
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The cell suppression problem (CSP) is one of the most widely applied post-tabular protection methods for tabular data. Given a set of sensitive cells to be protected, its aim is to find set of additional cells whose removal guarantees that estimates of values of sensitive cells fall out of a predefined protection interval. CSP is formulated as a very large mixed integer linear optimization problem. Due to its large scale is a very challenging problem for current general optimization solvers, and specialized approaches (namely, cutting planes or Benders decomposition) are needed for its solution (for instance, Benders decomposition is the algorithm used in the state-of-the-art optimal CSP implementation in Tau-Argus). However, the convergence to the optimal solution is often too slow due to well known instability issues of Benders decomposition. This work discusses a recently developed stabilized Benders method, in an attempt to avoid some of its instabilities. Some results are reported in the solution of generated and real-world CSP instances, showing the effectiveness of this approach. In some instances, stabilized Benders provided a very good solution in less than one minute, while the other available approaches (i.e., general or specialized codes, such as CPLEX or the optimal option in Tau-Argus) found no feasible solution in one hour.
CitacióBaena, D.; Castro, J.; Frangioni, A. Using a stabilized Benders algorithm for cell suppression. A: Joint UNECE/Eurostat Work Session on Statistical Data Confidentiality. "2019 joint UNECE/Eurostat Work Session on Statistical Data Confidentiality: The Hague, Netherlands: october 29-31, 2019: book of abstracts". John Wiley & sons, 2019, p. 1-3.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
SDC2019_S2_Catalonia_Baena-Castro-Frangioni.pdf | 80,07Kb | Accés restringit |