Brigitte Jaumard

Back

Cahiers du GERAD

164 results — page 7 of 9

, , , and

We propose a new coding algorithm (called NTUPLE) for computing the N-tuple code (due to Knop et al.) for chemical trees. The algorithm NTUPLE has a ti...

BibTeX reference
and

Consider a set <i>O</i> of <i>N</i> entities and a matrix <i>D</i> = (<i>d<sub>k <img src="ell.gif"></sub></i>) of dissimilarities between pairs of entities...

BibTeX reference
, , and

We consider nonlinear programs in 0-1 variables with nonlinear constraints and survey the main approaches to their solution: (i) linearization; (ii) algebra...

BibTeX reference
, , and

In a previous paper, a global optimization algorithm, called MLEW, is provided for finding Maximum Likelihood Estimators for the three-parameter Weibull dis...

BibTeX reference
, , and

An exact algorithm is proposed for average-linkage divisive hierarchical clustering, i.e., at each level of the hierarchy a cluster is bipartitioned in such...

BibTeX reference
and

Ce document explique comment réaliser une implantation efficace d'une méthode d'énumération implicite avec une stratégie du type le meilleur d'abord. Dans l...

BibTeX reference
, , and

A recent global optimization algorithm using decomposition (GOP), due to Floudas and Visweswaran, when specialized to the case of polynomial functions is sh...

BibTeX reference
, , and

We consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled around a common due date, <i>d</i>. The weight of a job ...

BibTeX reference
, , and

The off-line vertex enumeration problem for polytopes consists in determining all vertices of a given polytope <i>P</i>. The on-line vertex enumeration prob...

BibTeX reference
, , , , and

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part orien...

BibTeX reference
, , , and

Weber's problem consists in locating a facility in the plane in such a way that the weighted sum of Euclidean distances to <i>n</i> given points be minimum....

BibTeX reference
, , and

There has been much recent statistical research in the area of inference under constraints. Here we consider the problem of bounded parameter estimation, in...

BibTeX reference
, , and

In a first attempt to explain the good behavior of local improvement heuristics (such as Tabu Search and Simulated Annealing) for the <i>k</i>-coloring prob...

BibTeX reference
, , , and

A branch-and-bound algorithm is proposed for global minimization of indefinite quadratic functions subject to box constraints. Branching is done according ...

BibTeX reference
, , and

Interval arithmetic and Taylor's formula can be used to bound the slope of the cord of a univariate function at a given point. Such bounds for the function,...

BibTeX reference
, , and

Konno and Inori (1989) have recently proposed two flexible models for bond portfolio optimization, together with heuristics to solve them. It is shown that ...

BibTeX reference
, , and

A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms of tightness of the follow...

BibTeX reference
, , and

La programmation linéaire généralisée peut être étendue au cas des programmes mixtes en utilisant seulement l'algorithme primal révisé du simplexe en variab...

BibTeX reference
and

Indefinite quadratic programs with quadratic constraints can be reduced to bilinear programs with bilinear constraints by duplication of variables. Such red...

BibTeX reference
, , and

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process ...

BibTeX reference