Cahiers du GERAD
Recherche
Liste chronologique
3212 résultats — page 118 de 161
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 BibTeX
A fuzzy clustering problem consists in assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may be...
référence BibTeXLocation-Arc Routing Problems
<i>Location-Arc Routing Problems</i> (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges ...
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
This paper presents a dynamic programming approach for the solution of the Unit Loading Problem in hydroplant management. The model accounts for losses in t...
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 BibTeXRecherche de la structure optimale d'un réseau d'accès avec raccordement des usagers en arbre
Le problème traité dans ce rapport est celui de la conception de réseaux d'accès utilisant la technologie SONET et ayant une topologie en arbre. Nous dévelo...
référence BibTeXThe Theory of Exact Inference for Change Points in an Exponential Hazard Rate Model with Censoring
The goal in many data analyses is to produce brief summaries which convey the key conclusions. This will be particularly important in survival analysis in m...
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
Currently, technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology netwo...
référence BibTeX
This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...
référence BibTeX
We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...
référence BibTeX
Preapheresis quantification of circulating CD34+ cells (CD34) may be used to predict peripheral blood progenitor cell (PBPC) yield in subsequent leukapheres...
référence BibTeX
The distance matrix of a chemical graph can be computed in quadratic time, and from it can be obtained the distance level patterns (DLP), Wiener, Szeged and...
référence BibTeXAn Oil Pipeline Design Problem
We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...
référence BibTeX
This work develops a class of stochastic optimization algorithms. It aims to provide numerical procedures for solving threshold-type optimal control probl...
référence BibTeX
This paper deals with the class of uncertain systems with muliple time-delays. The stability and stabibizability of this class of systems are considered. Th...
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