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

An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

Currently, technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology netwo...

This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...

We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...

Preapheresis quantification of circulating CD34+ cells (CD34) may be used to predict peripheral blood progenitor cell (PBPC) yield in subsequent leukapheres...