Axis 1: Data valuation for decision making
BackCahiers du GERAD
421 results — page 6 of 22
The airline crew scheduling problem involves determining schedules for airline crew members such that all the scheduled flights over a planning horizon (usua...
BibTeX reference
This paper investigates the current patient transportation between services in a large hospital and provides a simulation-optimization solution to reduce com...
BibTeX referenceA new computational model of high-order stochastic simulation based on spatial Legendre moments
Multiple-point simulations have been introduced over the past decade to overcome the limitations of second-order stochastic simulations in dealing with geolo...
BibTeX reference
A new non-stationary, high-order sequential simulation method is presented herein, aiming to accommodate complex curvilinear patterns and high-order spatia...
BibTeX reference
High-order sequential simulation methods have been developped as an alternative to existing frameworks to facilitate the modelling of spatial complexity of...
BibTeX reference
In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...
BibTeX reference
Top-tier customers -that is, those 20% of customers that typically bring in 80% of all profits- are extremely valuable to companies. In the many instances ...
BibTeX reference
Genetic algorithms are used for feature selection through a fitness function that drives the evolution of populations. With parallel universes, an importance...
BibTeX reference
The eccentric connectivity
index of a connected graph G
is the sum over all vertices v
of the product dG(v)eG(v)
, where dG(v)
is ...
In this paper, we consider non-stationary response variables and covariates, where the marginal distributions and the associated copula may be time-dependent...
BibTeX reference
The eccentricity of a vertex v
in a graph G
is the maximum distance
between v
and any other vertex of G
. The diameter of a graph `(...
A graceful difference labeling (gdl for short) of a directed graph G
with vertex set V
is a bijection `(f:V\rightarrow{1,\ldots,\vert V\vert}...
Given a directed graph G=(V,A)
, capacity and cost functions on A
, a root r
, a subset T⊂V
of terminals, and an integer k
...
We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to tes...
BibTeX reference
Generally, the semiclosed-form option pricing formula for complex financial models depends on unobservable factors such as stochastic volatility and jump int...
BibTeX referenceA two-stage solution approach for personalized multi-department multi-day shift scheduling
In this paper, we address a personalized multi-department multi-day shift scheduling problem with a multi-skill heterogeneous workforce where employees can b...
BibTeX reference
Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...
BibTeX reference
In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with ...
BibTeX reference
Clustering is an automated and powerful technique for data analysis. It aims to divide a given set of data points into clusters which are homogeneous and/o...
BibTeX reference
The vertex p
-center problem consists in selecting p
centers among a finite set of candidates and assigning a set of clients to them, with the aim...