Column generation bounds for numerical microaggregation
From MaRDI portal
(Redirected from Publication:486386)
Recommendations
- A derivative-free algorithm for refining numerical microaggregation solutions
- An algorithm for the microaggregation problem using column generation
- A polynomial-time approximation to optimal multivariate microaggregation
- scientific article; zbMATH DE number 2080028
- A comparative study of microaggregation methods
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Branch and Bound Clustering Algorithm
- A polynomial-time approximation to optimal multivariate microaggregation
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Elements of statistical disclosure control
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Facets of the clique partitioning polytope
- Reformulations in Mathematical Programming: Definitions and Systematics
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: Methods and applications
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
Cited in
(2)
This page was built for publication: Column generation bounds for numerical microaggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486386)