Axis 1: Data valuation for decision making
BackCahiers du GERAD
407 results — page 17 of 21
We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...
BibTeX reference
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...
BibTeX reference
The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images of a torus. The algorithms are based on the ...
BibTeX reference
We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...
BibTeX reference
Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d<sub>i</sub> - d<sub>j</sub></...
BibTeX reference
The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images. The algorithms are based on the optimal filte...
BibTeX reference
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 ...
BibTeX reference
Generalized logical analysis aims at modelling complex biological systems, especially the so-called regulatory systems like genetic networks. The main feat...
BibTeX reference
A multivariate location model for cluster correlated observations is presented. An affine-invariant multivariate sign test for testing location is proposed...
BibTeX reference
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 ...
BibTeX referenceRecent Trends in Arc Routing
Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX referenceComputers in Graph Theory
A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.
BibTeX reference
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...
BibTeX reference
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 ...
BibTeX reference
Exploiting an overlooked observation of Blum, Kiefer & Rosenblatt (1961), Dugué (1975) and Deheuvels (1981a) described a decomposition of empirical distribu...
BibTeX reference
This paper introduces new rank-based statistics for testing against serial dependence in a univariate time series context. These Kolmogorov-Smirnov and Cram...
BibTeX referenceOn Uniform k-Partition Problems
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...
BibTeX reference
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
BibTeX reference