In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...

In this paper we illustrate a new methodology for the design of fault-tolerant logical topologies in wavelength-routed optical networks exploiting wavelengt...

This paper addresses the problem whether a cooperative agreement, made at the start of a game, can be sustained over time. The players can reopen negotiatio...

We analyze the extent to which intergenerational teams provide information on workers' productivity in the long run. We use a dynamic stochastic framework ...

The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note describes a simple en...

Inspired by previous results on asymptotic minimax estimation for a ball of increasing radius in R^<i>n</i>, we study the analogous problem for do...

In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port conf...

This paper presents a novel integration of interior point cutting plane methods within branch-and-price algorithms. Unlike the classical method, columns are...

This paper deals with sensitivity analysis (gradient estimation) of random horizon performance measures of Markov chains. More precisely, we consider genera...

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

The <i>p</i>-Center problem consists in locating <i>p</i> facilities and assigning clients to them in order to minimize the maximum distance between a clien...

This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as nec...

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

A fuzzy clustering problem consists in assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may be...

<i>Location-Arc Routing Problems</i> (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges ...

A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...

This paper presents a dynamic programming approach for the solution of the Unit Loading Problem in hydroplant management. The model accounts for losses in t...

Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...

Le problème traité dans ce rapport est celui de la conception de réseaux d'accès utilisant la technologie SONET et ayant une topologie en arbre. Nous dévelo...

The goal in many data analyses is to produce brief summaries which convey the key conclusions. This will be particularly important in survival analysis in m...