Cahiers du GERAD
Search
Chronological list
3212 results — page 18 of 161
This work is in the context of blackbox optimization where the functions defining the problem are expensive to evaluate and where no derivatives are availabl...
BibTeX reference
We study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds of controls. W...
BibTeX referenceBlackbox optimization
The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...
BibTeX referenceIntegrating learning and explicit model predictive control for unit commitment in microgrids
In this paper, we apply flexibility-based operational planning method to microgrid (MG) unit commitment (UC). The problem is formulated based on model predi...
BibTeX reference
Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learnin...
BibTeX referenceDeep 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 small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\) sides are unknown when ...
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \(n=2^s\) vertices is not known when `(s ...
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 reference
This paper develops a strategy, using concepts from Mean Field Games, to coordinate the charging of a large population of battery electric vehicles (BEVs...
BibTeX reference
The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which amounts to maximizing a quadratic function of binary variables,...
BibTeX reference
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\) vertices are not known ...
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \(n=2m\) vertices is not known when \(m\ge 7\). Finding the large...
A new linear model is presented herein to optimize strategic production scheduling of an open pit mine with multiple processing streams while accounting for...
BibTeX reference
Geostatistically simulated representations of mineral deposits are used for resource/reserve assessments, mine design and production planning, project evalua...
BibTeX reference
Industrial mining complexes can be optimized using simultaneous stochastic optimization (SSO), which manages the risks associated with meeting production tar...
BibTeX reference
This paper presents a new truck dispatching policy approach that is adaptive given different mining complex configurations in order to deliver supply materia...
BibTeX reference
The existing technologies that update geostatistically simulated models of mineral deposits cannot self-learn from incoming new information generated in oper...
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
This article presents a novel stochastic optimization model that simultaneously optimizes the short-term extraction sequence, shovel relocation, scheduling o...
BibTeX reference