An Optimization-Based Decomposition Heuristic for the Microaggregation Problem
- 14 September 2022
- book chapter
- Published by Springer Nature
- p. 3-14
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A derivative‐free algorithm for refining numerical microaggregation solutionsInternational Transactions in Operational Research, 2014
- Column generation bounds for numerical microaggregationJournal of Global Optimization, 2014
- K-Means2009
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirementDiscrete Optimization, 2007
- Efficient multivariate data-oriented microaggregationThe VLDB Journal, 2006
- Ordinal, Continuous and Heterogeneous k-Anonymity Through MicroaggregationData Mining and Knowledge Discovery, 2005
- A polynomial algorithm for optimal univariate microaggregationIEEE Transactions on Knowledge and Data Engineering, 2003
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Practical data-oriented microaggregation for statistical disclosure controlIEEE Transactions on Knowledge and Data Engineering, 2002
- Partitioning Around Medoids (Program PAM)1990