Cahiers du GERAD
Recherche
Liste chronologique
3128 résultats — page 24 de 157
We consider a class of min-max robust problems in which the functions that need to be robustified can be decomposed as the sum of arbitrary functions. This...
référence BibTeX
We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...
référence BibTeX
Drawing on statistical learning theory, we derive out-of-sample and optimality guarantees about the investment strategy obtained from a regularized portfoli...
référence BibTeX
This paper considers a dynamic Emergency Medical Services (EMS) network design problem and introduces two novel two-stage stochastic programming formulatio...
référence BibTeXThe value of randomized solutions in mixed-integer distributionally robust optimization problems
Randomized decision making refers to the process of taking decisions randomly according to the outcome of an independent randomization device such as a dic...
référence BibTeX
We consider several time series and for each of them, we fit an appropriate dynamic parametric model. This produces serially independent error terms for each...
référence BibTeX
La méthode des résidus minimaux (MINRES) de Paige et Saunders (1975), qui est souvent la méthode privilégiée pour les systèmes linéaires symétriques, est une...
référence BibTeX
For nearest neighbor univariate random walks in a periodic environment, where the probability of moving depends on a periodic function, we show how to estim...
référence BibTeX
Given \(n\)
points, a symmetric dissimilarity matrix \(D\)
of dimensions \(n\times n\)
and an integer \(p\geq 2\)
, the \(p\)
-dispersion problem (pD...
Nous étudions l'évolution dans le temps d'une industrie oligopolistique, différenciée verticalement et horizontalement, où les entreprises d’un même groupe p...
référence BibTeX
In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...
référence BibTeX
Computational speed and global optimality are a key need for pratical algorithms of the OPF problem. Recently, we proposed a tight-and-cheap conic relaxation...
référence BibTeX
Multi-agent reinforcement learning has made significant progress in recent years, but it remains a hard problem. Hence, one often resorts to developing lea...
référence BibTeX
Nous proposons une méthode itérative pour la résolution de systèmes de point de selle symétriques qui exploite la tridiagonalisation orthogonale de Saunders,...
référence BibTeX
Nous proposons une méthode de régularisation pour les problèmes aux moindres carrés non linéaires avec contraintes d'égalité. Notre appliquons les approches...
référence BibTeX
In demand-response programs, aggregators balance the needs of generation companies and end-users. This work proposes a two-phase framework that shaves the ag...
référence BibTeXMonotonic grey box optimization
We are interested in blackbox optimization for which the user is aware of monotonic behaviour of some constraints defining the problem. That is, when incr...
référence BibTeX
Nous assistons présentement à une accélération dans le développement des énergies renouvelables raccordées aux réseaux électriques. En raison des fluctuati...
référence BibTeX
Recommender systems make use of different sources of information for providing users with recommendations of items. Such systems are often based on collabor...
référence BibTeX
Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...
référence BibTeX