Brigitte Jaumard

Back

Cahiers du GERAD

164 results — page 4 of 9

, , , and

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
, , and

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
, , , , and

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

BibTeX reference
, , and

Given a network modeled by a probabilistic graph <i>G =</i> (<i>V,E</i>) with bounds on the operation probabilities of edges and of pairs of edges, the seco...

BibTeX reference
, , and

We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...

BibTeX reference
, , , and

The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...

BibTeX reference
, , and

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

BibTeX reference
, , and

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
, , and

We consider a resource constrained shortest path problem in acyclic graphs, where resource windows are associated with the arcs, while lower and upper thres...

BibTeX reference
, , , and

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...

BibTeX reference
, , , and

We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...

BibTeX reference
and

We propose a new finite cone covering algorithm for concave minimization over a polytope, in which the cones are defined by extreme points of the polytope. ...

BibTeX reference
, , , and

Non-parametric estimation of smooth functions belonging to Sobolev classes is closely related to the problem of estimating the (infinite dimensional) mean o...

BibTeX reference
and

We present a convergence proof of Tuy's cone splitting algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimization o...

BibTeX reference
, , , and

We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...

BibTeX reference
, , and

We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...

BibTeX reference
and

We propose a 0-1 column generation model for the problem of channel assignment in a cellular network, with the objective of minimizing the unsatisfied chann...

BibTeX reference
, , , and

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...

BibTeX reference
, , and

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

BibTeX reference
, , and

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

BibTeX reference