Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 72 de 155
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
référence BibTeX
La confection de calendriers sportifs dans le milieu scolaire québécois est une tâche complexe à laquelle la Fédération Québécoise du Sport Étudiant (FQSE) d...
référence BibTeX
The main goal of this paper is to bring a contribution in order to facilitate automatic refinement of Bimatrix Game Nash extreme equilibria. We show how maxi...
référence BibTeX
We introduce the OPAL framework in which the identification of good algorithmic parameters is interpreted as a black box optimization problem whose variables...
référence BibTeX
Recent advances in coupling novel optimization methods to large-scale computing problems have opened the door to tackling a diverse set of physically realist...
référence BibTeXVariable Neighbourhood Decomposition Search with Pseudo-Cuts for Multidimensional Knapsack Problem
In this paper we propose new matheuristics for solving multidimensional knapsack problem. They are based on the variable neighbourhood decomposition search (...
référence BibTeX
In several companies such as large retail stores, the employees perform different activities (e.g., cashier or clerk in a specific department) to respond to ...
référence BibTeXA Note on Diameters of Point Sets
Relationships between the diameter of a set of <i>n</i> points in the plane at mutual distance at least one, the diameter of an equilateral <i>n</i>-gon and ...
référence BibTeX
We present a new general variable neighborhood search approach for the uncapacitated single allocation <i>p</i>-hub median problem in networks. This NP-hard ...
référence BibTeX
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