Axis 1: Data valuation for decision making

Back

Cahiers du GERAD

413 results — page 21 of 21

G-95-02
Models and Algorithms for Probabilistic and Bayesian Logic
, , , and

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

BibTeX reference
G-94-56
Kekule Count in Tubular Hydrocarbons
, , and

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

BibTeX reference
G-91-33
Local Optima Topology for the k-coloring Problem
, , 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
G-91-40
On a Transformation which Preserves the Stability Number
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
G-91-38
A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs

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
G-91-36
New Polynomially Solvable Cases for the Maximum Stable Set Problem

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
G-91-31
A Tabu Search Heuristic for the Vehicle Routing Problem
, , 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
G-89-42
The Use of Domains in Multicriteria Decision Making
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
G-91-07
A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing
, , 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
G-90-51
On the Stability Number of AH-Free Graphs
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
G-86-21
Combinatorial Optimization Problems Soft and Hard Requirements
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
G-86-13
An Efficient Interchange Procedure for the Archaeological Seriation Problem
and

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

BibTeX reference
G-86-08
Classification de données: Une application à la segmentation des marchés internationaux
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