We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET ...

Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...

We propose a network design model for flat networks using hybrid optical/electronic equipments. We describe a set of network components that can be taken in...

This report deals with the class of uncertain dynamical systems with Markov jumps and time-delay. The problems of robust stability and stabilizability are c...

This report deals with the class of dynamical uncertain systems with Markov jumps and time-delay. We consider the stochastic stability and stochastic stabil...

The continuous <i>p</i>-defense-sum problem consists of locating <i>p</i> facilities in a convex polyhedron, such that the sum of the distances among all th...

This document deals with the robustness of stochastic stability and stabilizability of the class of dynamical deterministic systems with time-delay in the v...

This report deals with the stability and stabilizability of dynamical systems with time-delay. Sufficient conditions are developed to check whether a system...

The search for optimal non-parametric estimates of the cumulative distribution and hazard functions under order constraints inspired at least two earlier cl...

A combinatorial approach is used to derive asymptotic expressions for arbitrary moments of cumulative vector processes, as the time horizon goes to infinity...

Cet article de vulgarisation donne un bref aperçu des travaux réalisés en gestion des opérations dans les grands réseaux de transport. On y fait principalem...

Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a...

We consider a bilevel programming formulation of a freight tariff setting problem where the leader consists in one among a group of competing carriers and t...

Let <i>G</i> be a multigraph containing no minor isomorphic to <i>K</i>_3,3 or <i>K</i>₅<i>e</i> (where <i>K</i>₅<i>e</i> de...

We consider a case of the convex feasibility problem where the set is defined by an infinite number of certain strongly convex self-concordant inequalities....

One important challenge in nonparametric density and regression-function estimation is spatially inhomogeneous smoothness. This is often modelled by Besov-t...

We analyze an analytic center cutting plane algorithm for the convex feasibility problems with semidefinite cuts. At each iteration the oracle returns a ...

The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...

In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...

There is an increasing interest for efficient synthesis methods (routing and dimensioning) of large and robust multi-service networks. In the case of ATM ne...