Column generation bounds for numerical microaggregation

DOI10.1007/s10898-014-0149-3zbMath1312.90043OpenAlexW2050975551MaRDI QIDQ486386

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

zbMATH Keywords

column generationbranch-and-boundcutsmicroaggregation

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• Bonmin
• V-MDAV

Cites Work

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