Daniel Aloise
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniel Aloise has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Arthur Araújo
Department of Production Engineering Universidade Federal do Rio Grande do Norte Brazil
1 shared publication Bruno Jefferson de S. Pessoa
Univ Fed Paraiba UFPB, Ctr Informat, Joao Pessoa, Paraiba, Brazil
1 shared publicationCaroline Rocha
Universidade Federal do Rio Grande do Norte
1 shared publication- Dušan Džamić
Faculty of Organizational Sciences, University of Belgrade, Serbia
1 shared publication - Lucídio Dos Anjos Formiga Cabral
Universidade Federal da Paraíba
1 shared publication - Nenad Mladenović
GERAD and École des Hautes Études Commerciales
1 shared publication
Latest Publications
- 1 March 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 91, 121-131
The Weighted Fair Sequences Problem
- 1 March 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 91, 121-131
The Weighted Fair Sequences Problem
- 13 June 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 272 (1-2) , 273-287
Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization
- 13 June 2017
- Published by Springer Nature in Annals of Operations Research
- Vol. 272 (1-2) , 273-287
Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization
- 3 November 2014
- Published by Wiley in International Transactions in Operational Research
- Vol. 22 (4) , 693-712
A derivative‐free algorithm for refining numerical microaggregation solutions
The biggest challenge in disclosing private data is to share information contained in databases, while protecting people from being individually identified. Microaggregation is a family of methods for statistical disclosure control. The principle of microaggregation states that confidentiality rules permit the publication of individual records if they are divided into groups of g or more data, where none of the records is more representative than the others in the same group. The application of such rules leads to replacing individual values by those computed from small groups, which are denoted as microaggregates, before data publication. The microaggregation procedure should be developed to reduce the information loss caused by this replacement process to an extent, so that valuable and accurate information could still be extracted from the microaggregated data. This work proposes a derivative‐free optimization algorithm for the numerical microaggregation problem based on the evaluation of a simplified surrogate function. Computational experiments show that the proposed method can considerably improve the results obtained by other heuristics found in the literature, as it improves some of its best‐known results.
- 3 November 2014
- Published by Wiley in International Transactions in Operational Research
- Vol. 22 (4) , 693-712
A derivative‐free algorithm for refining numerical microaggregation solutions
The biggest challenge in disclosing private data is to share information contained in databases, while protecting people from being individually identified. Microaggregation is a family of methods for statistical disclosure control. The principle of microaggregation states that confidentiality rules permit the publication of individual records if they are divided into groups of g or more data, where none of the records is more representative than the others in the same group. The application of such rules leads to replacing individual values by those computed from small groups, which are denoted as microaggregates, before data publication. The microaggregation procedure should be developed to reduce the information loss caused by this replacement process to an extent, so that valuable and accurate information could still be extracted from the microaggregated data. This work proposes a derivative‐free optimization algorithm for the numerical microaggregation problem based on the evaluation of a simplified surrogate function. Computational experiments show that the proposed method can considerably improve the results obtained by other heuristics found in the literature, as it improves some of its best‐known results.
- 24 July 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (2) , 121-122
Global optimization workshop 2012
- 24 July 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (2) , 121-122
Global optimization workshop 2012