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

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

This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networ...

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

We derive the asymptotic distribution of the diaphony of <i>n</i> independent random variables uniformly distributed on [0,1], describe ways to approximate ...

The paper is concerned with sustainable cooperation in a vertical two-member channel of distribution over an infinite planning horizon. Sustainable intertem...

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

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

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

This paper studies the problem of <img src="hinfty.gif" align=middle> control for linear systems with Markovian jumping parameters. The jumping parameters ...

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

This paper deals with asymptotic optimality of a stochastic dynamic system driven by a singularly perturbed Markov chain with finite state space. The states...

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

We give an overview of the main techniques for generating uniform random numbers of computers. Theoretical and practical issues are discussed.

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