Axis 1: Data valuation for decision making
BackCahiers du GERAD
418 results — page 4 of 21
Deep reinforcement learning for optimal stopping with application in financial engineering
Optimal stopping is the problem of deciding the right time at which to take a particular action in a stochastic system, in order to maximize an expected rewa...
BibTeX reference
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...
BibTeX referenceTraining image free high-order stochastic simulation based on aggregated kernel statistics
A training-image free, high-order sequential simulation method is proposed herein, which is based on the efficient inference of high-order spatial statistics...
BibTeX reference
We study the average number \(A(G)\)
of colors in the non-equivalent colorings of a graph \(G\)
. We show some general properties of this graph invariant ...
The Bell numbers count the number of different ways to partition a set of \(n\)
elements while the graphical Bell numbers count the number of non-equivalen...
We empirically test the prediction of Pastor, stambaugh, and Taylor (2020) that green firms outperform brown firms when concerns about climate change increas...
BibTeX reference
Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...
BibTeX reference
We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...
BibTeX reference
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...
BibTeX reference
Data acquisition and recording in the form of databases are routine operations. The process of collecting data, however, may experience irregularities, res...
BibTeX reference
Conditional estimation given specific covariate values (i.e., local conditional estimation or functional estimation) is ubiquitously useful with applications...
BibTeX referenceDecycling bipartite graphs
Let \(G=(V,E)\)
be a graph and let \(S\subseteq V\)
be a subset of its vertices. If the subgraph of \(G\)
induced by \(V\setminus S\)
is acyclic, the...
Artificial Intelligence (AI) is the next society transformation builder. Massive AI-based applications include cloud servers, cell phones, cars, and pandemic...
BibTeX referenceStatistical learning with the determinantal point process
The determinantal point process (DPP) provides a promising and attractive alternative to simple random sampling in cluster analysis or classification, for th...
BibTeX reference
The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...
BibTeX reference
With sufficient layers, enough training data, enough time, and often a custom tailored architecture, modern deep learning methods can be extremely successf...
BibTeX reference
Deploying applications having many processes in a multi-cloud environment is challenging. The cloud manager has goals such as minimizing power consumption, w...
BibTeX reference
Clustering algorithms help identify homogeneous subgroups from data. In some cases, additional information about the relationship among some subsets of the d...
BibTeX referenceLearning chordal extensions
A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph repre...
BibTeX referenceThe conditional \(p\)-dispersion problem
We introduce the conditional \(p\)
-dispersion problem (c-pDP), an incremental variant of the \(p\)
-dispersion problem (pDP). In the c-pDP, one is given a...