# Brigitte Jaumard

Back## Cahiers du GERAD

### 164 results — page 5 of 9

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

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

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

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

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 referenceProbabilistic Satisfiability

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

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

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

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

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

BibTeX reference

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

We propose a new exact algorithm for the convex-quadratic bilevel programming problem, i.e, for problems with convex objective function and convex constrain...

BibTeX reference

Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...

BibTeX reference

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

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

Consider an assignment problem in which persons are qualified for some but usually not all of the jobs. Moreover, assume persons belong to given seniority c...

BibTeX referenceAn On-Line Cone Intersection Algorithm for Global Optimization of Multivariate Lipschitz Functions

We study the generalization of Piyavskii's algorithm (1972), proposed by Mladineo (1986), for the global optimization of multivariate Lipschitz functions. I...

BibTeX referenceGlobal Optimization in Location

Global optimization methods aim at finding the global optimum of a nonlinear and nonconvex function subject to nonlinear and nonconvex constraints. The main...

BibTeX reference

An overview is given, with new results, of mathematical models and algorithms for probabilistic logic, probabilistic entailment and various extensions. Anal...

BibTeX reference

Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (PSAT) problem consists, in it...

BibTeX reference