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
Research Subjects
Daniel Aloise has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Pierre Hansen
HEC Montreal
6 shared publications - Caroline Rocha
GERAD and Escola de Ciências e Tecnologia, Universidade Federal do Rio Grande do Norte, Brazil
2 shared publications - Leo Liberti
LIX CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
2 shared publications - Allyson Silva
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT), Québec, Canada
1 shared publication - Amit Deshpande
Microsoft Research India
1 shared publication - Celso C. Ribeiro
Universidade Federal Fluminense
1 shared publication
Latest Publications
- 1 April 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 290 (2) , 435-452
Heuristics for the dynamic facility location problem with modular capacities
- 1 April 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 290 (2) , 435-452
Heuristics for the dynamic facility location problem with modular capacities
- 18 February 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (2) , 165-182
Column generation bounds for numerical microaggregation
- 18 February 2014
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (2) , 165-182
Column generation bounds for numerical microaggregation
- 21 October 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 82 (4) , 046112
Column generation algorithms for exact modularity maximization in networks
Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [ Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but without a guarantee of optimality. There are few exact algorithms, prominent among which is a paper by Xu et al. [ Eur. Phys. J. B 60, 231 (2007)]. Modularity maximization can also be expressed as a clique partitioning problem and the row generation algorithm of Grötschel and Wakabayashi [ Math. Program. 45, 59 (1989)] applied. We propose to extend both of these algorithms using the powerful column generation methods for linear and non linear integer programming. Performance of the four resulting algorithms is compared on problems from the literature. Instances with up to 512 entities are solved exactly. Moreover, the computing time of previously solved problems are reduced substantially.
- 21 October 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 82 (4) , 046112
Column generation algorithms for exact modularity maximization in networks
Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [ Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but without a guarantee of optimality. There are few exact algorithms, prominent among which is a paper by Xu et al. [ Eur. Phys. J. B 60, 231 (2007)]. Modularity maximization can also be expressed as a clique partitioning problem and the row generation algorithm of Grötschel and Wakabayashi [ Math. Program. 45, 59 (1989)] applied. We propose to extend both of these algorithms using the powerful column generation methods for linear and non linear integer programming. Performance of the four resulting algorithms is compared on problems from the literature. Instances with up to 512 entities are solved exactly. Moreover, the computing time of previously solved problems are reduced substantially.
- 8 July 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 49 (3) , 449-465
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- 8 July 2010
- Published by Springer Nature in Journal of Global Optimization
- Vol. 49 (3) , 449-465
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- 20 April 2010
- Published by Springer Nature in Mathematical Programming
- Vol. 131 (1-2) , 195-220
An improved column generation algorithm for minimum sum-of-squares clustering
- 20 April 2010
- Published by Springer Nature in Mathematical Programming
- Vol. 131 (1-2) , 195-220
An improved column generation algorithm for minimum sum-of-squares clustering
- 23 March 2010
- Published by Springer Nature in Journal of Heuristics
- Vol. 17 (2) , 153-179
Adaptive memory in multistart heuristics for multicommodity network design
- 23 March 2010
- Published by Springer Nature in Journal of Heuristics
- Vol. 17 (2) , 153-179
Adaptive memory in multistart heuristics for multicommodity network design
- Open Access
- 1 December 2009
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 29 (3) , 503-516
A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n points into k clusters in order to minimize the sum of squared distances from the points to the centroid of their cluster. Recently, Peng & Xia (2005) established the equivalence between 0-1 semidefinite programming (SDP) and MSSC. In this paper, we propose a branch-and-cut algorithm for the underlying 0-1 SDP model. The algorithm obtains exact solutions for fairly large data sets with computing times comparable with those of the best exact method found in the literature.
- 1 December 2009
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 29 (3) , 503-516
Open AccessA branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n points into k clusters in order to minimize the sum of squared distances from the points to the centroid of their cluster. Recently, Peng & Xia (2005) established the equivalence between 0-1 semidefinite programming (SDP) and MSSC. In this paper, we propose a branch-and-cut algorithm for the underlying 0-1 SDP model. The algorithm obtains exact solutions for fairly large data sets with computing times comparable with those of the best exact method found in the literature.
- Top Cited PapersOpen Access
- 24 January 2009
- Published by Springer Nature in Machine Learning
- Vol. 75 (2) , 245-248
NP-hardness of Euclidean sum-of-squares clustering
- 24 January 2009
- Published by Springer Nature in Machine Learning
- Vol. 75 (2) , 245-248
Top Cited PapersOpen AccessNP-hardness of Euclidean sum-of-squares clustering