Infrastructures intelligentes (télécommunications, transport public, villes intelligentes)
RetourCahiers du GERAD
332 résultats — page 14 de 17
An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem
This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as nec...
référence BibTeX
On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...
référence BibTeXStable Sets and Chromatic Number
A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...
référence BibTeX
Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...
référence BibTeX
An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...
référence BibTeXRecherche à Voisinage Variable
La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...
référence BibTeX
Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...
référence BibTeX
Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...
référence BibTeX
Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...
référence BibTeX
We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...
référence BibTeX
Clique partitionning in Euclidean space <b>R</b><sup>n</sup> consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...
référence BibTeX
We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET ...
référence BibTeXAgrégation des contraintes de ressources en chaque noeud dans un problème de plus court chemin
Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...
référence BibTeX
We propose a network design model for flat networks using hybrid optical/electronic equipments. We describe a set of network components that can be taken in...
référence BibTeX
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...
référence BibTeX
Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...
référence BibTeX
A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...
référence BibTeXRegards sur la découverte
Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.
référence BibTeX
Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...
référence BibTeX