Brigitte Jaumard
RetourCahiers du GERAD
164 résultats — page 5 de 9
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 ...
référence BibTeX
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 ...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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 ...
référence BibTeX
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...
référence BibTeX
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 ...
référence BibTeX
This paper presents a 0 - 1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling. The master problem fin...
référence BibTeX
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...
référence BibTeX
It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXProbabilistic Satisfiability
A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...
référence BibTeXMixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem
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...
référence BibTeX
The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...
référence BibTeX
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...
référence BibTeX
D.-c. programming is a recent technique of global optimization, which allows the solution of problems whose objective function and constraints can be expres...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...
référence BibTeX