# Cahiers du GERAD

### Search

#### Chronological list

### 3064 results — page 1 of 154

In this work, we study a class of two-player deterministic finite-horizon difference games with coupled inequality constraints, where both players have two t...

BibTeX reference

```
The fine-tuning of Large Language Models (LLMs) has enabled them to recently achieve milestones in natural language processing applications. The emergenc...
```

BibTeX reference
Algorithme primal ajoutant des variables pour le problème du partitionnement d'ensemble généralisé

Le problème du partitionnement d'ensemble est un problème de programmation en nombres entiers très étudié. Le problème consiste à trouver une partition de tâ...

BibTeX reference

The *cosine measure* was introduced in 2003 to quantify the richness of a finite positive spanning sets of directions in the context of derivative-free direc...

Inventory management for slow-moving items is challenging due to their high intermittence and lumpiness. Recent developments in machine learning and computat...

BibTeX referenceThe heterogeneous-fleet electric vehicle routing problem with nonlinear charging functions

This paper introduces the Heterogeneous-Fleet Electric Vehicle Routing Problem with Nonlinear Charging Functions (HEVRP-NL). This problem involves routing a ...

BibTeX reference

A challenge in aircraft design optimization is the presence of non-computable, so-called hidden, constraints that do not return a value in certain regions of...

BibTeX reference

In this work, we improve the efficiency of Unit Commitment (UC) optimization solvers using a Graph Convolutional Neural Network (GCNN). In power systems, UC ...

BibTeX reference

This paper introduces a new step to the *Direct Search Method* (DSM) to strengthen its convergence analysis.
By design, this so-called *covering step* may e...

Determining optimal inventory replenishment decisions requires balancing the costs of excess inventory with shortage risks. While demand uncertainty has been...

BibTeX reference

In this work, we propose a non-intrusive and training free method to detect behind-the-meter (BTM) electric vehicle (EV) charging events from the data measur...

BibTeX reference

The Harwell Subroutine Library (HSL) is a renowned suite of efficient and robust numerical algorithms designed to tackle complex mathematical problems such a...

BibTeX reference

We show that the two-stage minimum description length (MDL) criterion widely used to estimate linear change-point (CP) models corresponds to the marginal lik...

BibTeX reference

We study the relation between the promotion of a cryptocurrency on Twitter and its return dynamics around pump-and-dump events. By analyzing abnormal retur...

BibTeX reference

Monte Carlo (MC) is widely used for the simulation of discrete time Markov chains. We consider the case of a `\(d\)`

-dimensional continuous state space and w...

Randomized Quasi-Monte Carlo (RQMC) methods provide unbiased estimators whose variance often converges at a faster rate than standard Monte Carlo as a functi...

BibTeX reference

This work introduces a novel multi-fidelity blackbox optimization algorithm designed to alleviate the resource-intensive task of evaluating infeasible points...

BibTeX reference

We develop a worst-case evaluation complexity bound for trust-region methods in the presence of unbounded Hessian approximations. We use the algorithm of Ar...

BibTeX reference

This study addresses large-scale personnel scheduling problems in the service industry by combining mathematical programming with data mining techniques to...

BibTeX reference

We consider the set of graphs that can be constructed from a one-vertex graph by repeatedly adding a clique or a stable set linked to all or none of the vert...

BibTeX reference