Axe 1 : Valorisation des données pour la prise de décision

Retour

Cahiers du GERAD

421 résultats — page 18 de 22

et

The 18<sup>th</sup> EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000 in Switzerland. The topic of ESWI XVIII, "Meta-heuristics in ...

référence BibTeX
, et

Generalized logical analysis aims at modelling complex biological systems, especially the so-called regulatory systems like genetic networks. The main feat...

référence BibTeX

A multivariate location model for cluster correlated observations is presented. An affine-invariant multivariate sign test for testing location is proposed...

référence BibTeX
et

The one-sided one sample problem with bivariate data is considered. A conditionally distribution-free sign test is proposed for that problem. This test is ...

référence BibTeX

Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...

référence BibTeX
, et

Finding augmenting chains is in the heart of the maximum matching problem, which is equivalent to the maximum stable set problem in the class of line graphs...

référence BibTeX
, et

In this paper, nonparametric tests are presented for the hypothesis of no direct treatment effects, as well as for the hypothesis of no carryover effects, f...

référence BibTeX

A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.

référence BibTeX
, et

The complexity status of the maximum stable set problem in the class of <i>P</i><sub>5</sub>-free graphs is unknown. In this paper, we first propose a chara...

référence BibTeX
, et

The maximum stable set problem is NP-hard, even when restricted to <i>banner</i>-free graphs. In this paper, we use the augmenting graph approach to attack ...

référence BibTeX
et

Exploiting an overlooked observation of Blum, Kiefer & Rosenblatt (1961), Dugué (1975) and Deheuvels (1981a) described a decomposition of empirical distribu...

référence BibTeX
, et

This paper introduces new rank-based statistics for testing against serial dependence in a univariate time series context. These Kolmogorov-Smirnov and Cram...

référence BibTeX
, , et

We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...

référence BibTeX
et

We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.

référence BibTeX
et

A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...

référence BibTeX
, et

We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

référence BibTeX
et

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...

référence BibTeX
et

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...

référence BibTeX
, et

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

référence BibTeX
, , et

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

référence BibTeX