Axis 1: Data valuation for decision making

Back

Cahiers du GERAD

418 results — page 21 of 21

and

The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...

BibTeX reference
, , and

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...

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

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 reference

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

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

BibTeX reference
, , and

Cylindrical aromatic compounds - fullerenes and hydrocarbons - are about to become highly interesting objects of chemical research. A tubulene (tubular ben...

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

We derive from Boolean methods a transformation which, when it can be applied, builds from a graph <i>G =</i> (<i>V,E</i>) a new graph <i>G'=</i> (<i>V',E'<...

BibTeX reference

For a weighted graph <i>G =</i> (<i>V,E</i>), the maximum weighted <i>k</i>-coloring problem is to color a set of vertices of maximum weight using <i>k</i> ...

BibTeX reference

We describe two new classes of graphs for which the stability number can be computed in polynomial time. The first approach is based on an iterative procedu...

BibTeX reference
, , and

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

BibTeX reference
and

This paper describes a domain criterion for a multicriteria problem, given a single decision maker. It then outlines possibilities for aggregating individua...

BibTeX reference

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
and

We describe a new class of graphs for which the stability number can be obtained in polynomial time. The algorithm is based on an iterative procedure which...

BibTeX reference
and

In this paper the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how...

BibTeX reference
and

This paper considers the archeological seriation problem defined over incidence matrices. Two procedures adapted from interchange algorithms for the travell...

BibTeX reference
and

Dans cet article nous procédons à une segmentation des marchés internationaux. Afin d'éliminer la redondance dans les 27 indicateurs socio-économiques consi...

BibTeX reference