Daniel Aloise : Cahiers : GERAD

mars 2018

On the \(k\)-medoids model for semi-supervised clustering

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

G-2018-23

mai 2017

The carousel scheduling problem

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

G-2017-37

avr. 2017

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

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

G-2017-30

nov. 2016

Less is more approach for balanced minimum sum-of-squares clustering

Leandro R. Costa, Daniel Aloise et Nenad Mladenović

G-2016-80

oct. 2016

On strategies to fix degenerate k-Means-means solutions

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

G-2016-81

oct. 2016

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

Artem Pyatkin, Daniel Aloise et Nenad Mladenović

G-2016-79

mai 2016

Ascent -- Descent Variable Neighborhood Decomposition search for community detection by modularity maximization

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

G-2016-35

déc. 2015

An iterative algorithm for the solution of very large-scale diameter clustering problems

Daniel Aloise et Claudio Contardo

G-2015-140

mars 2015

A model for clustering data from heterogeneous subjects

Éverton Santi, Daniel Aloise et Simon Blanchard

G-2015-18

oct. 2011

Modularity Maximization in Networks by Variable Neighborhood Search

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

G-2011-59

avr. 2011

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

G-2011-18

sept. 2010

A Variable Neighborhood Search Heuristic for Normalized Cut Clustering

Pierre Hansen, Manuel Ruiz et Daniel Aloise

G-2010-48

juin 2010

Column Generation Algorithms for Exact Modularity Maximization in Networks

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

G-2010-36

mai 2009

An Improved Column Generation Algorithm for Minimum Sum-of-squares Clustering

Daniel Aloise, Pierre Hansen et Leo Liberti

G-2009-25

fév. 2009

Exploring Adaptive Memory and Vocabulary Building to Improve a Multistart Heuristic for a Multicommodity Network Design Problem

Daniel Aloise et Celso C. Ribeiro

G-2009-09

mai 2008

A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of-Squares Clustering

Daniel Aloise et Pierre Hansen

G-2008-40

avr. 2008

Clustering - A Chapter for Handbook of Discrete and Combinatorial Optimization

Daniel Aloise et Pierre Hansen

G-2008-34

avr. 2008

NP-Hardness of Euclidean Sum-of-Squares Clustering

Daniel Aloise, Amit Deshpande, Pierre Hansen et P Popat

G-2008-33

mars 2008

Evaluating a Branch-and-Bound RLT-Based Algorithm for Minimum Sum-of-Squares Clustering

Daniel Aloise et Pierre Hansen

G-2008-26

juil. 2007

On the Complexity of Minimum Sum-of-Squares Clustering

Daniel Aloise et Pierre Hansen

G-2007-50

jan. 2006

A Hybrid Heuristic for a Real-Life Car Sequencing Problem with Painting and Assembly Line Constraints

Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline Rocha et Sebastián Urrutia

G-2006-02