Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A derivative-free algorithm for refining numerical microaggregation solutions

From MaRDI portal
Publication:2794680
Jump to:navigation, search

DOI10.1111/itor.12125zbMath1332.90349OpenAlexW2158076662MaRDI QIDQ2794680

Daniel Aloise, Arthur Araújo

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


zbMATH Keywords

derivative-free optimizationdata privacymicroaggregation


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Derivative-free methods and methods using generalized derivatives (90C56)



Uses Software

  • J-MEANS
  • ARGUS



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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2794680&oldid=15691199"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki