Cahiers du GERAD
Search
Chronological list
3082 results — page 143 of 155
On Transforming the Satisfiability and Maximum Satisfiability Problems into Set Covering Problems
We show that the satisfiability and maximum satisfiability problems can be transformed into set covering problems at the expense of acceptable increase of s...
BibTeX reference
Nous établissons un état de l'art exhaustif, conçernant les problèmes de tournées multivéhicules et nomo-dépots, avec contraintes de capacité et de fenêtres...
BibTeX reference
We propose a new algorithm to solve the on-line vertex enumeration problem for polytopes, doing all computations in <i>n</i>-space, where <i>n</i> is the di...
BibTeX reference
L'évaluation des émissions et le transport à grandes distances des polluants atmosphériques (TGDPA) sont des composantes essentielles de la problématique de...
BibTeX reference
We determine here sufficient conditions for finite dimensional moduloïds and pseudomodules to be lattices. As could be expected, completeness of the scalar ...
BibTeX reference
We consider the following global optimization problems for a Lipschitz function <i>f</i> implicitly defined on an interval [<i>a,b</i>]. Problem <i>P'</i>:...
BibTeX reference
We consider the following global optimization problems for a univariate Lipschitz function <i>f</i> defined on an interval [<i>a,b</i>]: Problem <i>P</i>: f...
BibTeX reference
In this note it is shown that no general hypothesis on the cost functions can guarantee that a Pareto optimal solution to a linear bilevel programming probl...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...
BibTeX reference
Consider a flow-shop with <i>n</i> parts, whose processing times are state dependent. Since the state often depends on the sequence, a hierarchical approach...
BibTeX referenceMaximum Sum-of-Splits Clustering
FORTRAN code of an efficient implementation of a <img src="Theta.gif" align=bottom> (<i>N</i><sub>2</sub>) algorithm for the maximum sum-of-splits clusterin...
BibTeX reference
We report on the development of a linear process model of energy supplies and uses in the province of Ontario (Canada). The minerals industries producing ...
BibTeX reference
The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...
BibTeX reference
The MARKAL-Québec dynamic process model is used to simulate the reaction of the Québec energy and industrial sectors to the imposition of upper limits on th...
BibTeX reference
This paper addresses the question of determining an optimal mix of gas contracts for a producer supplying the North American gas market. We first propose a ...
BibTeX reference
This paper proposes a numerical technique, called Turnpike Improvement, for the approximation of the solution of a class of piecewise deterministic control...
BibTeX reference
This paper deals with a class of stochastic differential games where the mode of play changes according to a stochastic jumpprocess. Between two successive...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes for a fleet of vehicles which services exactly once a set of customers...
BibTeX reference
This paper deals with a continuous-time stochastic control model designed for planning production and preventive maintenance in a flexible manufacturing syst...
BibTeX reference
This paper develops a conceptual framework for flexibility. A definition of flexibility is presented that is general enough to be applicable to all areas o...
BibTeX reference