Cahiers du GERAD
Recherche
Liste chronologique
3078 résultats — page 4 de 154
We introduce an iterative solver named MINARES for symmetric linear systems \(Ax \approx b\)
, where \(A\)
is possibly singular.
MINARES is based on t...
Operations research specialists at the OCP Group, the Mohammed VI Polytechnic University, and the Polytechnique Montreal operationalized a system optimizing ...
référence BibTeX
Decision trees are highly interpretable models for solving classification problems in machine learning (ML). The standard ML algorithms for training decision...
référence BibTeXThe indefinite proximal gradient method
We introduce a variant of the proximal gradient method in which the quadratic term is diagonal but may be indefinite, and is safeguarded by a trust region. ...
référence BibTeX
Tactical wireless networks are used in cases where standard telecommunication networks are unavailable or unusable, e.g. disaster relief operations. We fully...
référence BibTeX
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...
référence BibTeX
Perturbations are universal in supply chains, and their appearance is getting more frequent in the past few years. These perturbations affect industries and ...
référence BibTeXOptimizing 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...
référence BibTeX
This paper develops an efficient hybrid algorithm to solve the credit scoring problem. We use statistical mathematical programming to develop new classificat...
référence BibTeX
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...
référence BibTeX
The popularity of bike-sharing systems has constantly increased throughout the last years. Most of such success can be attributed to their multiple benefits,...
référence BibTeX
We consider the problem of minimizing the linear cost of multistate homogeneous series-parallel system given the nonlinear reliability constraint on the syst...
référence BibTeXA 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...
référence BibTeXPricing and unauthorized channel strategies for a global manufacturer considering import taxes
Pour couvrir les taxes à l'importation, un fabricant facture généralement un prix plus élevé sur un marché étranger que sur son marché domestique. La différe...
référence BibTeXFluxNLPModels.jl and KnetNLPModels.jl: Connecting deep learning models with optimization solvers
Cet article présente <code>FluxNLPModels.jl</code> et <code>KnetNLPModels.jl</code>, des nouveaux modules Julia permettant à des réseaux de neurones, définis...
référence BibTeX
The Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that has attracted much attention over the past four decades. In this problem, o...
référence BibTeX
Recently there has been a surge of interest in operations research~(OR) and the machine learning~(ML) community in combining prediction algorithms and optimi...
référence BibTeX
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...
référence BibTeX
Nous considérons une entreprise offrant un produit opaque, c'est-à-dire un produit dont les caractéristiques complètes ne sont révélées au consommateur qu'a...
référence BibTeX