# Sylvain Perron

Back## Publications

### Cahiers du GERAD

Détection de communautés dynamiques dans les réseaux évolutifs de développeurs au sein de Chrome

The time-stamped database provided by Google traces the code contributions to Chrome browser on the period from September 2008 to January 2014. It describes ...

BibTeX reference

For the last decades, community detection is a well-studied problem because it has applications in various fields. Variable Neighborhood Search (VNS) is an e...

BibTeX reference

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

BibTeX reference

In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

BibTeX reference

In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

BibTeX reference2000 Cahiers du GERAD

Le nombre de Cahiers du GERAD vient de dépasser 2000. C'est un nombre qui en dit long sur l'activité du centre. Nous profiterons de cette occasion pour fa...

BibTeX reference

This paper studies a districting problem which arises in the context of financial product pricing. The challenge lies in partitioning a set of small geogra...

BibTeX reference**Sylvain Perron**, Gilles Caporossi, Marcia Helena Moreira Paiva, and Marcelo Eduardo Vieira Segatto

This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...

BibTeX referenceFranchise Location Models and Cannibalization Effects: A Variable Neighborhood Search Approach

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

BibTeX reference

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

BibTeX reference

Dispersion problems consist of the selection of a fixed number of vertices from a given set so that some function of the distances among the vertices is maxi...

BibTeX reference

Finding communities, or clusters, or modules, in networks can be done by optimizing an objective function defined globally and/or by specifying conditions wh...

BibTeX reference**Sylvain Perron**

In the last ten years, finding communities in networks, has been the subject of intense studies. If modularity maximization is still one of the mostly studi...

BibTeX reference

Finding communities, or clusters, in networks, or graphs, has been the subject of intense studies in the last ten years. The most used criterion for that pu...

BibTeX reference

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Gi...

BibTeX reference

It is observed that mutations in the formulations of test problems over time are not infrequent. Ensuing problems are illustrated with examples from geometri...

BibTeX reference

A recent paper of Tuy and Hoai-Phuong published in <i>JOGO</i> (2007) 37:557--569 observes that there are errors in the reformulation of a signomial geometr...

BibTeX reference

The hexagon and heptagon with unit diameter and maximum sum of Euclidean distances between vertices are determined by enumerating diameter configurations, an...

BibTeX reference

We consider one of the most important issues for multinationals, the determination of transfer prices. To do so, we examine the example of a multinational co...

BibTeX reference**Sylvain Perron**

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

BibTeX referenceExact

*L*

_{2}-Norm Plane Separation

We consider the problem of separating two sets of points in an n-dimensional real space with a (hyper)plane that minimizes the sum of <i>L</i><sub>2</sub>-n...

BibTeX reference**Sylvain Perron**

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i><sub><i>ij</i></sub>) <sub>1 ≤ <i>i</i> < <i>j</i> ≤ <i>n</i></sub> is isome...

BibTeX reference

We consider the problem of separating two sets of points in an <i>n</i>-dimensional real space with a (hyper)plane that minimizes the sum of <i>L<sub>p</sub...

BibTeX referenceThe Minimum Diameter Octagon with Unit-Length Sides: Vincze's Wife's Octagon is Suboptimal

This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...

BibTeX reference

Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...

BibTeX reference### Articles

**Sylvain Perron**

**Sylvain Perron**, Jussara Farias Fardin, Domingos Sávio Lyrio Simonetti, and Cristina Engel de Alvarez

**Sylvain Perron**, and Gilles Caporossi

**Sylvain Perron**

**Sylvain Perron**, Gilles Caporossi, Marcia Helena Moreira Paiva, and Marcelo Eduardo Vieira Segatto

**Sylvain Perron**

**Sylvain Perron**, and Alberto Costa

**Sylvain Perron**

**Sylvain Perron**

**Sylvain Perron**

**Sylvain Perron**, Pierre Hansen, Sébastien Le Digabel, and Nenad Mladenović

**Sylvain Perron**

**Sylvain Perron**

**Sylvain Perron**

**Sylvain Perron**

### Book chapters

**Sylvain Perron**, Gilles Caporossi, and Christophe Duhamel

**Sylvain Perron**, and Manuel Ruiz

### Proceedings

**Sylvain Perron**

**Sylvain Perron**, and Manuel Ruiz