Cahiers du GERAD
Recherche
Liste chronologique
3237 résultats — page 142 de 162
Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...
référence BibTeX
We propose a new coding algorithm (called NTUPLE) for computing the N-tuple code (due to Knop et al.) for chemical trees. The algorithm NTUPLE has a ti...
référence BibTeX
A linear algorithm is proposed for a particular case of the satisfiability problem which strictly includes nested satisfiability. Recognition of this case c...
référence BibTeX
The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...
référence BibTeX
We propose a new branch-and-bound algorithm for the Satisfiability problem (SAT). A relaxation as well as a decomposition scheme are defined by using polyno...
référence BibTeX
We consider a price setting duopoly producing differentiated goods, where the players can learn by doing and from each other. The unit production cost is mo...
référence BibTeX
We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...
référence BibTeX
Consider a polyhex <i>H</i> which admits a perfect matching <i>M</i>. Harary, Klein and Zivkovic define the perfect matching vector of <i>M</i> as <img src...
référence BibTeXBonds Fixed by Fixing Bounds
In a normal benzenoid hydrocarbon <i>H</i> no bonds are fixed, i.e. each bond belongs to some perfect matching or Kekulé structure of <i>H</i>. Fixing one o...
référence BibTeX
In this research, two large scale MARKAL L. P. models of Québec and Ontario are used to evaluate the response of their energy systems to various economic an...
référence BibTeX
We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...
référence BibTeXOn the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problem
We analyze the convergence and the complexity of a potential reduction column generation algorithm for solving general convex or quasiconvex feasibility pro...
référence BibTeX
Cet article traîte de différentes méthodes, utilisant la théorie de la commande optimale stochastique et la programmation mathématique, qui permettent de pr...
référence BibTeX
We recently proposed to model location and sizing of offshore platforms for oil exploration and production as a multicapacitated plant location problem. We...
référence BibTeX
For a flexible manufacturing system, determining the feasible production set at a given time is essential for production management. In this paper, we prop...
référence BibTeX
In this paper we consider a maintenance and production model of a flexible manufacturing system. The maintenance activity involves lubrication, routine adju...
référence BibTeX
Consider a set <i>O</i> of <i>N</i> entities and a matrix <i>D</i> = (<i>d<sub>k <img src="ell.gif"></sub></i>) of dissimilarities between pairs of entities...
référence BibTeX
Let <i>H</i> denote a simply-connected cata-condensed polyhex. It is shown that if <i>H</i> has three hexagons in a row it does not have a maximum number of...
référence BibTeX
Ce document présente la façon dont a été traîtée la modélisation du secteur de la production électrique de 5 États américains selon l'approche MARKAL. Il es...
référence BibTeX
In this paper we assess the potential contribution of optimization based systems analysis methods in the modeling of economy-energy-environment interactio...
référence BibTeX