Brigitte Jaumard

Back

Cahiers du GERAD

164 results — page 5 of 9

, , and

We present an overview of the exact methods for channel assignment in cellular networks together with a new linear 0-1 column generation formulation. After ...

BibTeX reference
and

We present a new convergence result for the cone partitioning algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimiz...

BibTeX reference
and

Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel retuning of an urban network has to be done in ...

BibTeX reference
, , and

We present a 0-1 column generation model for channel block assignment in a cellular network, with the objective of minimizing the interference level. Priori...

BibTeX reference
, , and

We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...

BibTeX reference
and

We propose a greedy heuristic and a Tabu Search type heuristic for channel block assignment subject to co-channel, adjacent channel, co-site constraints as ...

BibTeX reference
and

Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel resetting of an urban network has to be done in...

BibTeX reference
, , and

This paper presents a 0 - 1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling. The master problem fin...

BibTeX reference
and

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clusterin...

BibTeX reference
, , , and

It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...

BibTeX reference
, , and

Clustering with a criterion which minimizes the sum of squared distances to cluster centroids is usually done in a heuristic way. An exact polynomial algori...

BibTeX reference
, , , and

Two new algorithms are proposed for the problem of positioning a new product in attribute space in order to attract the maximum number of consumers. Each c...

BibTeX reference
and

A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...

BibTeX reference
, , and

The column generation approach to large-scale linear programming is extended to the mixed-integer case. Two general algorithms, a dual and a primal one, are...

BibTeX reference
, , , and

The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...

BibTeX reference
, , and

We present a new method for minimizing the sum of a convex function and a product of <i>k</i> nonnegative convex functions over a convex set. This problem i...

BibTeX reference
, , , and

D.-c. programming is a recent technique of global optimization, which allows the solution of problems whose objective function and constraints can be expres...

BibTeX reference
, , , and

We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...

BibTeX reference
, , and

Weber's problem is to locate a facility in order to minimize the sum of its weighted distances to <i>n</i> fixed demand points. On a sphere, this problem i...

BibTeX reference
, , and

We propose a branch-and-bound framework for the global optimization of unconstrained Hölder functions. The general framework is used to derive two algorithm...

BibTeX reference