Column generation bounds for numerical microaggregation

DOI10.1007/S10898-014-0149-3zbMATH Open1312.90043OpenAlexW2050975551MaRDI QIDQ486386FDOQ486386

Pierre Hansen, Daniel Aloise, Caroline Rocha, Éverton Santi

Publication date: 15 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0149-3

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

zbMATH Keywords

microaggregationcolumn generationbranch-and-boundcuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Elements of statistical disclosure control
• Variable neighbourhood search: Methods and applications
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• Variable neighborhood search: Principles and applications
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• An improved column generation algorithm for minimum sum-of-squares clustering
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Facets of the clique partitioning polytope
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Reformulations in Mathematical Programming: Definitions and Systematics
• A polynomial-time approximation to optimal multivariate microaggregation
• A Branch and Bound Clustering Algorithm
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

Cited In (2)

• A derivative-free algorithm for refining numerical microaggregation solutions
• An algorithm for the microaggregation problem using column generation

Uses Software

• Bonmin
• V-MDAV

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)