Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 39 de 155
This paper presents an optimization method to solve the short-term unit commitment and loading problem with uncertain inflows. A scenario tree is built base...
référence BibTeX
In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...
référence BibTeX
Inspired by successful biological collective decision mechanisms such as honey bees searching for a new colony or the collective navigation of fish schoo...
référence BibTeX
This paper addresses the problem of minimizing the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data is known ...
référence BibTeX
Advanced Metering Infrastructures ({AMI}s) lay the foundation of a wide variety of smart grid applications. Despite their low capacity, RF-mesh systems are a...
référence BibTeX
Nous considérons le problème de la \(k\)
-coupe maximale qui consiste à partitionner l'ensemble des sommets d'un graphe en \(k\)
sous-ensembles tels que l...
Cet article présente les résultats de deux explorations, une exhaustive, des graphes de 4 à 10 sommets, et l'autre utilisant le programme AGX-III, des graphe...
référence BibTeX
On considère un jeu dynamique, linéaire dans l'état qui se déroule sur un arbre d'événements. On détermine analytiquement le prix de l'anarchie, ainsi que d...
référence BibTeXStrategic support of node-consistent cooperative outcomes in dynamic games played over event trees
Dans cet article, nous montrons que les gains coopératifs dans un jeu dynamique défini sur un arbre d'événements peuvent avoir un support stratégique, c'est-...
référence BibTeX
We use a newly developed model of the entire Canadian energy system (TIMES-Canada) to assess the climate change mitigation potential of different agri-food c...
référence BibTeX
The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...
référence BibTeX
The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, part...
référence BibTeX
An edge-coloring of a graph \(G=(V,E)\)
is a function \(c\)
that assigns an integer \(c(e)\)
(called color) in \(\{0,1,2,\dotsc\}\)
to every edge `(...
In the literature, graphs are often studied in terms of invariants, for instance the number of vertices or edges, the stability number, the chromatic number ...
référence BibTeX
When dealing with node or link failures in Software Defined Networking (SDN), the network capability to establish an alternative path depends on controller r...
référence BibTeX
Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...
référence BibTeX
In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in ...
référence BibTeX
This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...
référence BibTeX
Facility layout problems are an important class of operations research problems that has been studied for several decades. Most variants of facility layout ...
référence BibTeX
Nous étudions l'impact de la séquence des décisions sur les politiques d'adaptation et de réduction des émissions dans le contexte des problèmes environnemen...
référence BibTeX