The utility of Bayes and empirical Bayes techniques is illustrated on an important problem often encountered in small area estimation. We propose various Ba...

We propose an improved version of the neighbor-joining algorithm (NJ) of Saitou and Nei (1987), which is one of the most popular distance methods to reconst...

This paper reports the use of an advanced Multi-region Bottom-up model, the Extended MARKAL, for an in-depth investigation of the responses by the Québec-On...

This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. This problem consists of modifyin...

In this paper we will present UNJ, an unweighted version of the NJ algorithm (Saitou and Nei 1987; Studier and Keppler 1988). We will demonstrate that UNJ i...

The purpose of this document is to introduce the potential users to the new features of Extended MARKAL, stochastic programming and multiple region capabili...

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clusterin...

Future patterns of climate change and economic growth are critical parameters in long­term energy planning. This paper describes a multi­stage stochastic p...

This paper formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem with binary variables, and propo...

Managing redundant information is becoming an important issue in today's increasingly large distributed computer networks. As total redundancy is extremely ...

La méthode de génération de colonnes est couramment utilisée pour résoudre des problèmes d'optimisation de grande taille. En pratique, on observe fréquemmen...

We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and~1. We fir...

Cet article présente une étude comparative des algorithmes de flot maximum pour la résolution du problème de fermeture maximale sur un graphe. Plusieurs ap...

Convergence rate results are derived for a stochastic optimization problem where a performance measure is minimized with respect to a vector parameter <img ...

The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasi...

It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...

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...

This paper describes two interior-point algorithms for solving a class of monotone variational inequalities defined over the intersection of an affine set a...

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...

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...