Cahiers du GERAD
Search
Chronological list
3018 results — page 1 of 151
Tactical wireless networks are used in cases where standard telecommunication networks are unavailable or unusable, e.g. disaster relief operations. We fully...
BibTeX reference
Recommender systems provide personalized recommendations to their users for items and services. They do that using a model that is tailored to each user to i...
BibTeX reference
Perturbations are universal in supply chains, and their appearance is getting more frequent in the past few years. These perturbations affect industries and ...
BibTeX referenceOptimizing strategies for short-term hydropower scheduling using a blackbox optimization framework
This paper presents a study on the best possible use of optimization models for the short-term hydropower scheduling problem. Different deterministic and sto...
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
This paper develops an efficient hybrid algorithm to solve the credit scoring problem. We use statistical mathematical programming to develop new classificat...
BibTeX reference
The emerging demand for electric bicycles in recent years has prompted several bike-sharing systems (BSS) around the world to adapt their service to a new wa...
BibTeX reference
The popularity of bike-sharing systems has constantly increased throughout the last years. Most of such success can be attributed to their multiple benefits,...
BibTeX reference
We consider the problem of minimizing the linear cost of multistate homogeneous series-parallel system given the nonlinear reliability constraint on the syst...
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...
A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems
In this paper, we study the pickup and delivery problem with time windows and multiple compartments (PDPTWMC). The PDPTWMC generalizes the pickup and delive...
BibTeX referencePricing and unauthorized channel strategies for a global manufacturer considering import taxes
To cover the import taxes, a manufacturer typically charges a higher price in a foreign market than in its domestic market. The price difference can lead to ...
BibTeX referenceFluxNLPModels.jl and KnetNLPModels.jl: Connecting deep learning models with optimization solvers
This paper presents <code>FluxNLPModels.jl</code> and <code>KnetNLPModels.jl</code>, new Julia packages enabling a neural network, modelled with either Flux....
BibTeX reference
The Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that has attracted much attention over the past four decades. In this problem, o...
BibTeX reference
Recently there has been a surge of interest in operations research~(OR) and the machine learning~(ML) community in combining prediction algorithms and optimi...
BibTeX reference
This paper studies linear-quadratic Stackelberg games with a major player (leader) and \(N\)
minor players (followers). To design decentralized strategies ...
Online dynamic submodular optimization
We propose new algorithms with provable performance for online binary optimization subject to general constraints and in dynamic settings. We consider the su...
BibTeX reference
Two-stage stochastic programs are a class of stochastic problems where uncertainty is discretized into scenarios, making them amenable to solution approaches...
BibTeX reference
We consider a firm offering an opaque good over one selling season, that is, a product whose full characteristics are only revealed after the consumer comp...
BibTeX reference
We present a Julia framework dedicated to partially-separable problems whose element function are detected automatically. This framework takes advantage of ...
BibTeX reference