Publications

Articles

jan. 2019

Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization

Dušan Džamić, Daniel Aloise et Nenad Mladenović

Annals of Operations Research, 272(1-2), 273–287, 2019 référence BibTeX

juin 2018

Parallel synchronous and asynchronous coupled simulated annealing

Kayo Gonçalves-E-Silva, Daniel Aloise et Samuel Xavier-de-Souza

The Journal of Supercomputing, 74(6), 2841–2869, 2018 référence BibTeX

juin 2018

Less is more: Simplified Nelder-Mead method for large unconstrained optimization

Kayo Gonçalves-E-Silva, Daniel Aloise, Samuel Xavier-de-Souza et Nenad Mladenović

Yugoslav Journal of Operations Research, 28(2), 153–169, 2018 référence BibTeX

avr. 2018

A bi-objective vehicle routing problem integrating routing operations into tactical clustering decisions

Diego Rocha, Daniel Aloise, Dario J. Aloise et Claudio Contardo

Soumis à : Applied Soft Computing, 2018 référence BibTeX

mars 2018

A review of Dynamic Data Envelopment Analysis: state of the art and applications

Fernanda B.A.R. Mariz, Mariana R. Almeida et Daniel Aloise

International Transactions in Operational Research, 25(2), 469–505, 2018 référence BibTeX

mars 2018

A sampling-based exact algorithm for the solution of the minimax diameter clustering problem

Daniel Aloise et Claudio Contardo

Journal of Global Optimization, 71, 613–630, 2018 référence BibTeX

nov. 2017

Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering

Leandro R. Costa, Daniel Aloise et Nenad Mladenović

Information Sciences, 415-416, 247–253, 2017 référence BibTeX

oct. 2017

NP-hardness of balanced minimum sum-of-squares clustering

Artem Pyatkin, Daniel Aloise et Nenad Mladenović

Pattern Recognition Letters, 97, 44–45, 2017 référence BibTeX

juil. 2017

On strategies to remove degeneracy in k-means

Daniel Aloise, Nielson Castelo Damasceno, Nenad Mladenović et Daniel Nobre Pinheiro

Journal of Classification, 34(2), 165–190, 2017 référence BibTeX

juin 2017

The carousel scheduling problem

Bruno Jefferson de Sousa Pessoa, Daniel Aloise et Lucídio dos Anjos Formiga Cabral

Soumis à : Computers & Operations Research, 2017 référence BibTeX

juin 2017

Extracting summary piles from sorting task data

Simon Blanchard, Daniel Aloise et Wayne S. DeSarbo

Journal of Marketing Research, 54(3), 398–414, 2017 référence BibTeX

juin 2017

A polynomial-time algorithm for the discrete facility location problem with limited distances and capacity constraints

Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise et Thiago P. Jeronimo

Brazilian Journal of Operations & Production Management, 14(2), 136–144, 2017 référence BibTeX

sept. 2016

A model for clustering data from heterogeneous dissimilarities

Éverton Santi, Daniel Aloise et Simon Blanchard

European Journal of Operational Research, 253(3), 659–672, 2016 référence BibTeX

fév. 2016

Theory and applications of data clustering

Costas Panagiotakis, Emmanuel Ramasso, Paraskevi Fragopoulou et Daniel Aloise

Mathematical Problems in Engineering, 2016, 1–2, 2016 référence BibTeX

juil. 2015

A derivative-free algorithm for refining numerical microaggregation solutions

Daniel Aloise et Arthur Araújo

International Transactions in Operational Research, 22(4), 693–712, 2015 référence BibTeX

oct. 2014

Column generation bounds for numerical microaggregation

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

Journal of Global Optimization, 60(2), 165–182, 2014 référence BibTeX

sept. 2014

A simple and effective genetic algorithm for the two-stage capacitated facility location problem

Diogo R.M. Fernandes, Caroline Rocha, Daniel Aloise, Glaydston Mattos Ribeiro, Enilson M. Santos et Allyson Fernandes da Costa Silva

Computers and Industrial Engineering, 75, 200–208, 2014 référence BibTeX

août 2014

Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search

João Paulo Queiroz dos Santos, Jorge Dantas de Melo, Adrião Dória Duarte Neto et Daniel Aloise

Expert Systems with Applications, 41(10), 4939–4949, 2014 référence BibTeX

jan. 2014

On the Weber facility location problem with limited distances and side constraints

Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen et Leo Liberti

Optimization Letters, 8(2), 407–424, 2014 référence BibTeX

jan. 2012

An improved column generation algorithm for minimum sum-of-squares clustering

Daniel Aloise, Pierre Hansen et Leo Liberti

Mathematical Programming, 131(1-2), 195–220, 2012 référence BibTeX

jan. 2012

A VNS heuristic for escaping local extrema entrapment in normalized cut clustering

Pierre Hansen, Manuel Ruiz et Daniel Aloise

Pattern Recognition, 45(12), 4337–4345, 2012 référence BibTeX

jan. 2012

The heterogeneous p-median problem for categorization based clustering

Simon Blanchard, Daniel Aloise et Wayne S. DeSarbo

Psychometrika, 77(4), 741–762, 2012 référence BibTeX

jan. 2011

Adaptive memory in multistart heuristics for multicommodity network design

Daniel Aloise et Celso C. Ribeiro

Journal of Heuristics, 17(2), 153–179, 2011 référence BibTeX

jan. 2011

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

Daniel Aloise et Pierre Hansen

Journal of Global Optimization, 49(3), 449–465, 2011 référence BibTeX

jan. 2010

Column generation algorithms for exact modularity maximization in networks

Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Leo Liberti et Sylvain Perron

Physical Review E, 82(4, article), 9 pages, 2010 référence BibTeX

jan. 2009

NP-hardness of euclidean sum-of-squares clustering

Daniel Aloise, Amit Deshpande, Pierre Hansen et P Popat

Machine Learning, 75(2), 245–248, 2009 référence BibTeX

jan. 2009

A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering

Daniel Aloise et Pierre Hansen

Pesquisa Operacional, 29, 503–516, 2009 référence BibTeX

Chapitres de livre

déc. 2018

Review of basic local searches for solving the minimum sum-of-squares clustering problem

Thiago Correia Pereira, Daniel Aloise, Jack Brimberg et Nenad Mladenović

Pardalos P., Migdalas A. (eds), Open Problems in Optimization and Data Analysis, Springer Optimization and Its Applications, vol. 141, Springer, Cham, 249–270, 2018 référence BibTeX

jan. 2013

Modularity maximization in networks by Variable Neighbourhood Search

Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron et Manuel Ruiz

Graph Partitioning and Graph Clustering, 558, American Mathematical Society, 113–127, 2013 référence BibTeX

jan. 2010

On the facility location problem with limited distances and side constraints

Daniel Aloise, Isaac F. Fernandes, Pierre Hansen, Leo Liberti et Dario J. Aloise

Proceedings of TOGO 2010, 19–22, 2010 référence BibTeX

Actes de conférence

oct. 2018

On the k-medoids model for semi-supervised clustering

Rodrigo Alves Randel, Daniel Aloise, Nenad Mladenović et Pierre Hansen

6th International Conference on Variable Neighborhood Search, Greece, 2018 référence BibTeX

août 2017

SIMDEA: Sistema Integrado de Modelagens em Analise Envoltória de Dados

B. Soares, M.J. Queiroz, Tales Silva, Mariana R. Almeida, Daniel Aloise et J.C.C. Mello

XLIX Simpósio Brasileiro de Pesquisa Operacional, Blumenau, Brazil, 2017 référence BibTeX

sept. 2016

A new global optimization algorithm for diameter minimization clustering

Daniel Aloise et Claudio Contardo

Global Optimization Workshop - GOW 2016, Braga, Portugal, 171–174, 2016 référence BibTeX

sept. 2014

A variable neighborhood search matheuristic for the heterogeneous p-median problem

Éverton Santi, Daniel Aloise et Simon Blanchard

Global Optimization Workshop - GOW 2014, Malaga, Spain, 2014 référence BibTeX

juin 2013

nch-and-prune algorithm for multidimensional scaling preserving cluster partition

Jorge Alencar, Tibérius Bonates, Guilherme Liberali et Daniel Aloise

Workshop on Distance Geometry and Applications (DGA13), Manaus, Brazil, 2013 référence BibTeX

juin 2012

A column generation heuristic for microdata protection

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

Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 121–124, 2012 référence BibTeX

juin 2012

A column generation algorithm for semi-supervised minimum sum-of-squares clustering

Daniel Aloise, Pierre Hansen et Caroline Rocha

Proceedings of the Global Optimization Workshop 2012, Natal, Brazil, 19–22, 2012 référence BibTeX

juin 2012

Scalability analysis of a parallel coupled simulated annealing implementation

Kayo Gonçalves-E-Silva, Samuel Xavier-de-Souza et Daniel Aloise

Global Optimization Workshop - GOW 2012, Natal, Brazil, 2012 référence BibTeX

fév. 2012

Modularity maximization in networks by variable neighborhood search

Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron et Manuel Ruiz

Proceedings of the 10th DIMACS Implementation Challenge Workshop, 2012 référence BibTeX