Column generation bounds for numerical microaggregation
- 18 February 2014
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (2) , 165-182
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- An algorithm for k-anonymous microaggregation and clustering inspired by the design of distortion-optimized quantizersData & Knowledge Engineering, 2011
- An improved column generation algorithm for minimum sum-of-squares clusteringMathematical Programming, 2010
- Density-based microaggregation for statistical disclosure controlExpert Systems with Applications, 2010
- Reformulations in Mathematical Programming: Definitions and SystematicsRAIRO - Operations Research, 2009
- TFRP: An efficient microaggregation algorithm for statistical disclosure controlJournal of Systems and Software, 2007
- 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
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993