Cahiers du GERAD
Search
Chronological list
3083 results — page 126 of 155
The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasi...
BibTeX reference
It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...
BibTeX referenceBIONJ: une version améliorée de l'algorithme NJ basée sur un modèle simple des données biologiques
L'algorithme NJ de Saitou et Nei (1987) est l'une des méthodes les plus utilisées pour reconstruire des phylogénies à partir de matrices de distances évolut...
BibTeX referenceLong-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators
This paper describes two interior-point algorithms for solving a class of monotone variational inequalities defined over the intersection of an affine set a...
BibTeX reference
Clustering with a criterion which minimizes the sum of squared distances to cluster centroids is usually done in a heuristic way. An exact polynomial algori...
BibTeX reference
We study the problem of finding a shortest collision-free path for a point car-like robot maneuvering around polygonal obstacles in a room bounded by a poly...
BibTeX referenceShort Exact Sequences of Pseudomodules: a Canonical Approach to the Decomposition of Pseudomodules
We show here how to define short exact sequences in pseudomodules. More precisely, for a given subpseudomodule <i>M</i> of a pseudomodule <i>N</i>, we defin...
BibTeX reference
This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networ...
BibTeX reference
A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on app...
BibTeX reference
We derive the asymptotic distribution of the diaphony of <i>n</i> independent random variables uniformly distributed on [0,1], describe ways to approximate ...
BibTeX reference
The paper is concerned with sustainable cooperation in a vertical two-member channel of distribution over an infinite planning horizon. Sustainable intertem...
BibTeX reference
We study the problem of minimizing the peak load in single-command cycle shared storage policies. The peak load is the maximum of the daily material handlin...
BibTeX reference
Diverses classes de modèles permettant la génération de solutions pour des problèmes d'implantations d'usines sont décrits. La description de chacune des c...
BibTeX reference
We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...
BibTeX reference
This paper studies the problem of <img src="hinfty.gif" align=middle> control for linear systems with Markovian jumping parameters. The jumping parameters ...
BibTeX reference
Uniformity tests based on a discrete form of entropy are introduced and studied in the context of empirical testing of uniform random number generators. Nu...
BibTeX reference
This paper deals with asymptotic optimality of a stochastic dynamic system driven by a singularly perturbed Markov chain with finite state space. The states...
BibTeX reference
In a subway system, when a train leaves one station to go to another power consumption increases and, at one point, reaches a peak. When such peaks occur s...
BibTeX referenceRandom number generation
We give an overview of the main techniques for generating uniform random numbers of computers. Theoretical and practical issues are discussed.
BibTeX reference
Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex <i>s</i> to a vertex <i>t</i> with the smallest possible range of a...
BibTeX reference