Axis 1: Data valuation for decision making
BackCahiers du GERAD
421 results — page 7 of 22
Combining losing games into a winning game
Parrondo's paradox is extended to regime switching random walks in random environments. The paradoxical behavior of the resulting random walk is explained...
BibTeX reference
The survivorship bias in credit risk modeling is the bias that results in parameter estimates when the survival of a company is ignored. We study the statist...
BibTeX reference
Within state-of-the-art optimization solvers such as IBM--CPLEX the ability to solve both convex and nonconvex Mixed-Integer Quadratic Programming (MIQP) pro...
BibTeX referenceStochastic orebody modelling and stochastic long-term production scheduling for an iron ore deposit
For over a decade, stochastic optimization has emerged as a framework that is capable of generating a life-of-mine production schedule that increases ne...
BibTeX reference
Relatively recent techniques for categorical simulations are based on multi-point statistical approaches where a training image is used to derive complex spa...
BibTeX reference
In Positron Emission Tomography (PET), deep crystals (>20 mm) must be used to enhance detection efficiency and increase overall scanner sensitivity. Howeve...
BibTeX referenceCCGO: Fast heuristic global optimization
Global optimization problems are very hard to solve, especially when the nonlinear constraints are highly nonconvex, which can result in a large number of di...
BibTeX reference
In this paper we solve the discrete time mean-variance hedging problem when asset returns follow a multivariate autoregressive hidden Markov model. Time dep...
BibTeX reference
In this paper, we first present a review of statistical tools that can be used in asset management either to track financial indexes or to create synthetic o...
BibTeX reference
The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...
BibTeX reference
We consider the problems of determining the metric dimension and the minimum cardinality of doubly resolving sets in n
-cubes.
Most heuristics develope...
We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to te...
BibTeX referencePricing decisions in fast fashion retailing using discrete choice dynamic programming model
In this study, the problem environment consists of two fast fashion retailing firms where one can obtain the other's selling data from an outside agent. The ...
BibTeX reference
Recently, two different copula-based approaches have been proposed to estimate the conditional quantile function of a variable Y
with respect to a vect...
This paper analyzes the effects of geological heterogeneity representation in a producing reservoir, when different stochastic simulation methods are used, s...
BibTeX reference
For pattern-based simulation methods such as SIMPAT, filtersim, wavesim, ect, patterns are stored by scanning a training image with a sliding template. Dimen...
BibTeX reference
Given a complete directed graph G
with weights on the vertices and on the arcs, a θ
-improper k
-coloring of G
is an assignment of...
The maximum k
-colorable subgraph problem (k
-MCSP) is to color as many vertices as possible with at most k
colors, such that no two adjacent...
Clustering addresses the problem of finding homogeneous and well-separated subsets, called clusters, from a set of given data points. In addition to the poi...
BibTeX reference
The k
-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of
heuristics based on location-allocation steps that ...