Cette étude exploratoire est originale dans le champ de l'accompagnement. A partir de la base de données horodatées fournie par Google, notre étude retrace l...

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...

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

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...

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...

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...

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...

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

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...

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 ...

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...

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

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...

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...

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...

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

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...

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

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...

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

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>₂-n...

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i>_<i>ij</i>) _{1 &le; <i>i</i> &lt; <i>j</i> &le; <i>n</i>} is isome...

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...

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...

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