Pierre Hansen
RetourCahiers du GERAD
369 résultats — page 6 de 19
Minimum sum-of-squares clustering consists in partitioning a given set of <i>n</i> points into <i>c</i> clusters in order to minimize the sum of squared dist...
référence BibTeX
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...
référence BibTeX
In this paper we present a simple technique that uses background information to improve mining the frequent patterns of structured data. This technique uses ...
référence BibTeXSyGMA: Reducing Symmetry in Graph Mining
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases th...
référence BibTeX
With the help of the AutoGraphiX system, we study relations of the form
<img src="/cgi-bin/mimetex.cgi?\underline{b}m \le i1(G) \oplus i_2(G) \le \overl...
référence BibTeX
Clusterwise regression is a technique for clustering data. Instead of using the classical homogeneity or separation criterion, clusterwise regression is ba...
référence BibTeX
In previous work, bimatrix games were expressed as parametric linear mixed 0-1 programs and the <img src="/cgi-bin/mimetex.cgi?{\rm E}_\chi">MIP algorithm w...
référence BibTeX
Consider a convex polygon <i>V<sub>n</sub></i> with <i>n</i> sides, perimeter <i>P<sub>n</sub></i>, diameter <i>D<sub>n</sub></i>, area <i>A<sub>n</sub></i>...
référence BibTeX
The AutoGraphiX system (AGX 1 and AGX 2) for interactive, and for several functions automated, graph theory, discovers conjectures of algebraic or structura...
référence BibTeX
<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>
<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...
référence BibTeXVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...
référence BibTeX
To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We...
référence BibTeX
Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures
Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...
référence BibTeX
In the set of all connected graphs with a given domination number, we characterize the graphs which achieve the maximum value of the spectral radius of the ...
référence BibTeX
We show that among connected graphs with maximum clique size <img src="/cgi-bin/mimetex.cgi?\omega">, the minimum value of the spectral radius of adjacency m...
référence BibTeX
We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieving the same lower bound than the "sta...
référence BibTeX
Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...
référence BibTeX
A set of vertices <i>S</i> in a graph <i>G</i> is a clique if any two of its vertices are adjacent. The clique number <img src="/cgi-bin/mimetex.cgi?\omega"...
référence BibTeX
In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous locat...
référence BibTeX