Smart infrastructure (telecommunications, public transport, smart cities)
BackCahiers du GERAD
333 results — page 8 of 17
Degeneracy of Harmonic Means Clustering
It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....
BibTeX referenceMaximizing Edge-Ratio Is NP-Complete
Given a graph <i>G</i> and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divid...
BibTeX reference
The GRIEG model is a hybrid model of demo-economic projections that combines two approaches: the econometric approach - based on the micro-economy - of the N...
BibTeX reference
Community detection in networks based on modularity maximization is currently done with hierarchical divisive or agglomerative as well as with partitioning h...
BibTeX reference
Heuristics are widely applied to modularity maximization models for the identification of communities in complex networks. We present an approach to be appli...
BibTeX referencePlanning Rapid Transit Networks
Le but de cet article est de décrire et de résoudre un nouveau et important problème auquel font face les compagnies maritimes spécialisées dans le transport...
BibTeX reference
We present a new column generation algorithm for the determination of a classifier in the two classes LAD (Logical Analysis of Data) model. Unlike existing a...
BibTeX reference
We study extremal graphs for the extremal values of the second largest <i>Q</i>-eigenvalue of a connected graph. We first characterize all simple connected g...
BibTeX reference
Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods (e.g. [1...
BibTeX reference
Traditionally, IP Network planning and design is mostly based on average delay or loss constraints which can often be easily calculated. Jitter, on the othe...
BibTeX reference
We present a new general variable neighborhood search approach for the uncapacitated single allocation <i>p</i>-hub median problem in networks. This NP-hard ...
BibTeX reference
The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...
BibTeX reference
A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...
BibTeX reference
Using the AutoGraphiX system, we obtain conjectures of the form <img src="/cgi-bin/mimetex.cgi?l(n) \leq q_1 \oplus i(G)\leq u(n)"> where <img src="/cgi-bin...
BibTeX reference
Let <i>G</i> be a connected graph of order <i>n</i>. The algebraic connectivity of <i>G</i> is the second smallest eigenvalue of the Laplacian matrix of <i>G...
BibTeX reference
The <i>proximity</i> <img src="/cgi-bin/mimetex.cgi?\pi = \pi (G)"> of a connected graph <i>G</i> is the minimum, over all vertices, of the average distance ...
BibTeX reference
We address the problem of locating in the plane objects such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundarie...
BibTeX reference
Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...
BibTeX referenceVariable Neighborhood Search
Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...
BibTeX reference
Let <i>Q = D + A</i> denote the signless Laplacian matrix of a graph <i>G</i> of order <i>n</i>, where <i>D</i> is the diagonal matrix of the degrees and <i...
BibTeX reference