A derivative-free algorithm for refining numerical microaggregation solutions
From MaRDI portal
Publication:2794680
DOI10.1111/itor.12125zbMath1332.90349OpenAlexW2158076662MaRDI QIDQ2794680
Publication date: 11 March 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12125
Applications of mathematical programming (90C90) Derivative-free methods and methods using generalized derivatives (90C56)
Uses Software
Cites Work
- Unnamed Item
- Column generation bounds for numerical microaggregation
- Globalization strategies for mesh adaptive direct search
- Variable neighbourhood search: Methods and applications
- A polynomial-time approximation to optimal multivariate microaggregation
- Introduction to Derivative-Free Optimization
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
This page was built for publication: A derivative-free algorithm for refining numerical microaggregation solutions