Axis 1: Data valuation for decision making
BackCahiers du GERAD
421 results — page 17 of 22
Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...
BibTeX reference
We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level locati...
BibTeX referenceSelected Topics in Column Generation
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...
BibTeX reference
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...
BibTeX reference
The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....
BibTeX reference
In this paper, we adapt the Wilcoxon signed-rank test to the case of cluster correlated data. A simple modification of the estimator of the asymptotic vari...
BibTeX reference
The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...
BibTeX reference
In this paper, we perform an empirical comparison of the classification error of several ensemble methods based on classification trees. This comparison is b...
BibTeX reference
We consider the problem of testing the hypothesis that a multivariate location vector is in the positive orthant. A conditionally distribution-free sign te...
BibTeX referenceGoodness-of-fit Procedures for Copula Models Based on the Integral Probability Transformation
An approach is suggested for testing whether the dependence structure of a random sample of multivariate data is appropriately modelled by a given family of ...
BibTeX reference
The augmenting chain technique has been applied to solve the maximum stable set problem in the class of line graphs (which coincides with the maximum matchin...
BibTeX reference
Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...
BibTeX reference
Given a finite set <i>E</i> and a family <i>F</i>={<i>E</i><sub>1</sub>,...,<i>E<sub>m</sub></i>} of subsets of <i>E</i> such that <i>F</i> covers <i>E</i>...
BibTeX reference
This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...
BibTeX reference
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