# Cahiers du GERAD

### Search

#### Chronological list

### 2969 results — page 5 of 149

In this paper we examine the stability of international environmental agreements about a (common) emissions target. By signing the agreement, the parties d...

BibTeX reference

The increasingly complex energy systems are turning the attention towards model-free control approaches such as reinforcement learning (RL). This work propos...

BibTeX reference

A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with `\(n=2^s\)`

vertices is not known when `\(s \ge 3\)`

. T...

Robust integration of electric vehicles charging load in smart grids capacity expansion planning

Battery charging of electric vehicles (EVs) needs to be properly coordinated by electricity producers to maintain the network reliability. In this paper, we ...

BibTeX reference

Binary quadratic programming (BQP) is a class of combinatorial optimization problems comprising binary variables, quadratic objective functions and linear/no...

BibTeX reference

We develop a trust-region method for minimizing the sum of a smooth term `\(f\)`

and a nonsmooth term `\(h\)`

, both of which can be nonconvex.
Each iteratio...

Adaptive simultaneous stochastic optimization of mining complexes: Where is the value coming from?

This paper aims to identify the sources of value created in the strategic plan of a mining complex when the adaptive simultaneous stochastic optimization of ...

BibTeX referenceStochastic stope design optimization under grade uncertainty and dynamic development costs

Stope design optimization defines mineable three-dimensional material volumes to be extracted from a mineral deposit, aiming to maximize cashflows subject ...

BibTeX reference

The geometallurgical models that predicting the throughput/comminution performance of the a processing plant often rely on rock hardness models, which are ba...

BibTeX reference

In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-orde...

BibTeX reference

We explore the use of Array-RQMC, a randomized quasi-Monte Carlo method designed for the simulation of Markov chains, to reduce the variance when simulating...

BibTeX referenceMultiple streams with recurrence-based, counter-based, and splittable random number generators

We give an overview of the state of the art on the design and implementation of random number generators for simulation and general Monte Carlo sampling in p...

BibTeX reference

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 ...