Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1419 results — page 4 of 71
Efficiently solving a vehicle routing problem (VRP
) in a practical runtime is a critical challenge for delivery management companies. This pa...
This poster conceptually lays out recent advances in trustworthy machine learning (ML) that are of great interest for power systems applications like virtu...
BibTeX reference
The truck loading and inventory routing problems are the two most important decisions made by companies replenishing petrol stations. This paper investigates...
BibTeX referenceCorrigendum: A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
The purpose of the present note is to bring clarifications to certain concepts and surrounding notation of Aravkin et al. (2022). All results therein contin...
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...
An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence...
BibTeX reference
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
Bus scheduling in public transit consists in determining a set of bus schedules to cover a set of timetabled trips at minimum cost. This planning process has...
BibTeX reference
Yield uncertainty is an important issue in various industries such as agriculture, food, and textile where the production output is reliant on uncontrollable...
BibTeX referenceAlgorithme 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...
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
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
This work introduces a novel multi-fidelity blackbox optimization algorithm designed to alleviate the resource-intensive task of evaluating infeasible points...
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
The Network Design Problem with Vulnerability Constraints and Probabilistic Edge Reliability (NDPVC-PER) is an extension of the NDPVC obtained by additionall...
BibTeX reference