Publicação
Exact disclosure prevention in two-dimensional statistical tables
| dc.contributor.author | Carvalho, Filipa D. | |
| dc.contributor.author | Almeida, Maria Teresa | |
| dc.date.accessioned | 2023-10-30T10:36:37Z | |
| dc.date.available | 2023-10-30T10:36:37Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | We propose new formulations for the exact disclosure problem and develop Lagrangian schemes, that rely on shortest path problems, to generate near optimal solutions. Computational experience is reported for 550 tables with up to 40,000 cells. A proven optimal solution was obtained for 95% of the instances and a near optimal solution was computed for each remaining instance as well as an upper bound on the deviation from the optimum. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.citation | Carvalho, Filipa D. and Maria Teresa Almeida .(2004). “Exact disclosure prevention in two-dimensional statistical tables”. Computers & Operations Research, Volume 32, Issue 11 : pp. 2919-2936 (Search PDF in 2023). | pt_PT |
| dc.identifier.doi | doi:10.1016/j.cor.2004.04.015 | pt_PT |
| dc.identifier.issn | 0305-0548 | |
| dc.identifier.uri | http://hdl.handle.net/10400.5/29148 | |
| dc.language.iso | eng | pt_PT |
| dc.publisher | Elsevier | pt_PT |
| dc.subject | Statistical Disclosure | pt_PT |
| dc.subject | Cell Suppression | pt_PT |
| dc.subject | Graph Theory | pt_PT |
| dc.subject | Integer Programming | pt_PT |
| dc.subject | Lagrangian Relaxation | pt_PT |
| dc.title | Exact disclosure prevention in two-dimensional statistical tables | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | article | pt_PT |