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

In this paper a new approach for the facility layout problem is presented. This approach combines genetic algorithms with linear programming to design the ...

This paper investigates a new phenomenon of degeneracy in the continuous location-allocation problem. This phenomenon relates to the existence of solutions ...

This paper deals with the class of linear time-delay systems with Markovian jumping parameters (LTDSMJP). We mainly extend the stability results of the dete...

Two new algorithms are proposed for the problem of positioning a new product in attribute space in order to attract the maximum number of consumers. Each c...

This paper analyzes the productivity of a robotic production cell, functioning under a repetitive robot movement cycle. For a general <i>m</i> machine cell...

We consider the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expecte...