# Brigitte Jaumard

Back## Cahiers du GERAD

### 164 results — page 3 of 9

We consider the problem of traffic grooming of low-rate traffic circuits in WDM rings where circuits are associated with a set of heterogeneous granularitie...

BibTeX reference

Different integer linear programming (ILP) formulations have been proposed for the routing and wavelength assignment problem in WDM optical networks, mainl...

BibTeX reference

We present a review of column generation formulations for the Routing and Wavelength Assignment (rwa) problem with the objective of minimizing the blocking r...

BibTeX reference

We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem i...

BibTeX reference

We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem i...

BibTeX referenceRouting and Wavelength Assignment in Single Hop All Optical Networks with Minimum Blocking

WDM networks offer a technology that can transferred several optical signals into a single optical fiber. This allows for more efficient use of the huge capa...

BibTeX reference

A Golomb ruler with <i>M</i> marks can be defined as a set {<i>a<sub>i</sub></i>} of integers so that all differences δ<sub><i>ij</i></sub> = <i>a<sub>...

BibTeX reference

The Golomb Ruler problem consists in finding $n$ integers such that all possible differences are distinct and such that the largest difference is minimum. W...

BibTeX reference

In this paper we propose a mathematical model for the dimensioning of a 3G multimedia network and design a Tabu Search heuristic to solve it. The model is a...

BibTeX reference

We define two classes of lower bounds using either one or two simplices for the minimization of a concave function over a polytope. For each of them, a pro...

BibTeX reference

Consider <i>N</i> entities to be classified (e.g., geographical areas), a matrix of dissimilarity between pairs of entities, a graph <i>H</i> with vertices a...

BibTeX reference

This paper presents an analysis of the forward link capacity of a cellular network, based on IS-95 CDMA technology. The forward link, or downlink, refers to...

BibTeX reference

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...

BibTeX reference

Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...

BibTeX reference

We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...

BibTeX reference

The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...

BibTeX reference

Clique partitionning in Euclidean space <b>R</b><sup>n</sup> consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...

BibTeX reference

Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...

BibTeX reference

We study several formulations of the channel assignment problem in an FDMA network as a linear integer 0-1 program. We consider the objective of minimizing...

BibTeX reference

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whether these prob...

BibTeX reference