Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 35 of 69
The multi-activity assignment problem consists of assigning interruptible activities to given work shifts so as to match as much as possible for each activit...
BibTeX reference
The purpose of this paper is to present and solve a new, important planning problem faced by many shipping companies dealing with the transport of bulk produ...
BibTeX reference
The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to service given customers exactly once each while satisfyi...
BibTeX reference
A positive basis is a minimal set of vectors whose nonnegative linear combinations span the entire space R<i><sup>n</sup></i>. Interest in positive bases wa...
BibTeX reference
Climate change is one of the greatest challenges facing our planet in the foreseeable future and despite the urgency of the situation global GHG emissions ...
BibTeX reference
In this paper we establish the definition of the <i>set of ε-proper equilibria</i> of a bimatrix game. We define a 0-1 mixed quadratic program to ge...
BibTeX reference
Dans cet article, on raconte l'histoire de l'équipe GENCOL et du logiciel d'optimisation du même nom. C'est avant tout le récit d'une collaboration qui se po...
BibTeX reference
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
BibTeX reference
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...
BibTeX reference
We introduce the OPAL framework in which the identification of good algorithmic parameters is interpreted as a black box optimization problem whose variables...
BibTeX reference
Recent advances in coupling novel optimization methods to large-scale computing problems have opened the door to tackling a diverse set of physically realist...
BibTeX reference
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 ...
BibTeX referenceA 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 ...
BibTeX reference
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 ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX referenceEnhanced 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...
BibTeX reference
The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...
BibTeX reference
A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...
BibTeX reference
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...
BibTeX reference