Cahiers du GERAD
Recherche
Liste chronologique
2934 résultats — page 65 de 147
In this paper, we propose a generic model based on linear programming that allows building an optimal production plan for a work shift in an open-pit mine. T...
référence BibTeX
Cet article propose une nouvelle architecture générique pour l'implantation d'un système intelligent de contrôle en temps réel basé sur la simulation dans de...
référence BibTeXEnhanced Branch-and-Price-and-Cut for Vehicle Routing with Split Deliveries and Time Windows
In this paper, we study the split delivery vehicle routing problem with time windows SDVRPTW that is a variant of the well-known vehicle routing problem with...
référence BibTeX
In this study, we compare various computational approaches to Bayesian small area estimation of proportions in logistic regression models. The basic idea con...
référence BibTeX
The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...
référence BibTeX
A total dominating set in a digraph <i>G</i> is a subset <i>W</i> of its vertices such that every vertex of <i>G</i> has an immediate successor in <i>W</i>. ...
référence BibTeX
A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...
référence BibTeX
Using the AutoGraphiX system, we obtain conjectures of the form <img src="/cgi-bin/mimetex.cgi?l(n) \leq q_1 \oplus i(G)\leq u(n)"> where <img src="/cgi-bin...
référence BibTeX
Let <i>G</i> be a connected graph of order <i>n</i>. The algebraic connectivity of <i>G</i> is the second smallest eigenvalue of the Laplacian matrix of <i>G...
référence BibTeX
This study investigated the influence of working memory capacity on the dynamics of text composition from source, notably the strategy used by writers to con...
référence BibTeX
In this article we find the optimal solution of the hedging problem in discrete time by minimizing the mean square hedging error, when the underlying assets ...
référence BibTeX
A crew pairing is a sequence of flights, connections and rests that start and end at a crew base and is assigned to a single crew. The crew pairing problem c...
référence BibTeX
This paper investigates design methods of protection schemes in survivable WDM networks which use pre-configured protection structures (<i>p</i>-structures) ...
référence BibTeX
This study analyzes the use of neural network to produce accurate forecasts of total bookings and cancellations before departure, of a major rail operator. ...
référence BibTeX
A challenge in many applications of non-parametric curve estimation is that the function must satisfy some (lower and/or upper) variable order constraints (f...
référence BibTeX
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search....
référence BibTeXMalliavin Calculus and Clark-Ocone Formula for Functionals of a Square-Integrable Lévy Process
In this article, we construct a Malliavin derivative for functionals of a square-integrable Lévy process. The Malliavin derivative is defined via chaos expan...
référence BibTeX
This intentionally short tutorial is an introduction to the main features of AMPL that are relevant to nonlinear optimization model authoring. Pointers are g...
référence BibTeX
We consider a two-player asymmetric differential game of pollution control. One player is non-vulnerable to pollution, or unwilling to consider damages when ...
référence BibTeXA Variable Neighborhood Search Based Algorithm for Finite-Horizon Markov Decision Processes
This paper considers the application of a Variable Neighborhood Search (VNS) algorithm for finite-horizon (<i>H</i> stages) Markov Decision Processes (MDPs),...
référence BibTeX