Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 131 de 155
Les techniques adaptatives développées dans la littérature requièrent en général la connaissance d'un modèle paramétré du système à commander. Or, en pratiq...
référence BibTeX
This article describes an extension of the MARKAL energy model, in which the demands for energy services are elastic to their own prices. The new model is c...
référence BibTeXGlobal Optimization in Location
Global optimization methods aim at finding the global optimum of a nonlinear and nonconvex function subject to nonlinear and nonconvex constraints. The main...
référence BibTeX
An overview is given, with new results, of mathematical models and algorithms for probabilistic logic, probabilistic entailment and various extensions. Anal...
référence BibTeX
The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on d...
référence BibTeX
Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...
référence BibTeX
In this paper we examine an enumerative solution approach for the directed Rural Postman Problem (RPP) based on transforming the RPP into a version of a Gen...
référence BibTeX
In this paper, we present a scenario aggregation algorithm for the solution of the dynamic minimax problem in stochastic programming. We consider the case w...
référence BibTeX
Cylindrical aromatic compounds - fullerenes and hydrocarbons - are about to become highly interesting objects of chemical research. A tubulene (tubular ben...
référence BibTeX
Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (PSAT) problem consists, in it...
référence BibTeX
In this article, we examine the evaluation of the economic potentials of various renewable energy technologies. We first argue that traditional evaluation m...
référence BibTeX
We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...
référence BibTeX
In this paper we propose a scenario-oriented optimization model and solution algorithm to assess the capacity and the routing of computer networks. The adva...
référence BibTeX
A count of Kekulé structures for all 1812 distinct fullerene isomers of C<sub>60</sub> shows that 20 isomers surpass the count of 12500 for icosahedral C<su...
référence BibTeX
This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft ...
référence BibTeX
In this paper we consider the Discrete Lotsizing and Scheduling Problem with sequence dependent setup costs and setup times (DLSPSD). DLSPSD contains eleme...
référence BibTeX
Le présent article constitue un résumé du mémoire de maîtrise de M. Lavigne, présentement candidat au Ph.D. à l'École Polytechnique de Montréal. L'étude rep...
référence BibTeX
This paper presents methods to determine the optimal transfer batch sizes of various part types between two machines so as to minimize the sum of the total ...
référence BibTeX
This paper presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufactur...
référence BibTeXHow to Choose K Entities Among N
A new paradigm for cluster analysis is outlined. It is called Sequential Clustering. Given a set <i>O</i> of <i>N</i> entities a best cluster of <i>K</i> ...
référence BibTeX