# Brigitte Jaumard

Back## Cahiers du GERAD

### 164 results — page 3 of 9

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

We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels...

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

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

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

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

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

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

We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...

BibTeX reference

We study the solution of combinatorial problems with the column generation techniques when there is a very large number of both variables and constraints. ...

BibTeX reference

Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...

BibTeX reference

Cellular manufacturing is a promising approach for grouping efficiency in manufacturing systems. Although this problem has been extensively studied in the ...

BibTeX reference

Solving exactly large instances of the channel assignment problem often requires to solve large linear programs with respect to the number of columns or row...

BibTeX reference