Cahiers du GERAD
Recherche
Liste chronologique
3212 résultats — page 119 de 161
In this paper, we study the aircraft loading problem (ALP) which consists of transporting a series of items between two different points by aircraft at a mi...
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
In this paper, we survey applications and algorithms pertaining to an important class of price setting problems formulated in the framework of bilevel progr...
référence BibTeX
This paper studies the class of uncertain linear systems with time-delay and Markov jump disturbance, in which the time-delay is assumed to be dependent on...
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
A Basic Variable Neighbourhood Search heuristic is applied to min-max global optimization problems. The method is tested on the spread spectrum radar polyph...
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
The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...
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
The operating schedule problem in open-pit mine can be associated with the problem of maximal closure on a graph. In the literature, the Lagrangian relaxati...
référence BibTeX
Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...
référence BibTeX
Since Hinkley's original work on exact inference for a change in a sequence of random variables, many authors have proposed different methods based either o...
référence BibTeXPROCFTN: Une nouvelle procédure du choix flou pour les problèmes d'affectation multicritère
Ce papier présente une nouvelle procédure de classification, appelée PROCFTN, basée sur le domaine de l'aide multicritère à la décision. Le principe général...
référence BibTeX
In a research synthesis on the prognosis of depression, the outcome of interest has a multinomial distribution with the following typical categories: well, ...
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
This report deals with the class of uncertain dynamical systems with Markov jumps and time-delay. The problems of robust stability and stabilizability are c...
référence BibTeX
This report deals with the class of dynamical uncertain systems with Markov jumps and time-delay. We consider the stochastic stability and stochastic stabil...
référence BibTeX