Cahiers du GERAD
Search
Chronological list
3237 results — page 65 of 162
Projected Krylov methods are full-space formulations of Krylov methods that take place in a nullspace. Provided projections into the nullspace can be compute...
BibTeX reference
This paper studies a districting problem which arises in the context of financial product pricing. The challenge lies in partitioning a set of small geogra...
BibTeX reference
The paper surveys the literature on cooperative advertising in marketing channels (supply chains) using game theoretic methods. During the last decade in p...
BibTeX reference
We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...
BibTeX referenceNetwork Descriptors Based on Betweenness Centrality and Transmission and their Extremal Values
Transmission and betweenness centrality are key concepts in communication networks theory. In this paper, a series of network descriptors based on betweenne...
BibTeX reference
Le changement climatique constitue un défi majeur du 21<sup>e</sup> siècle. C'est un phénomène global, transfrontalier s'inscrivant dans un horizon de temps ...
BibTeX referenceOnline Traffic Aware Virtual Machine Placement in Multi Data Center Cloud Computing Networks
Cloud Computing applications are inherently oriented to send and receive information between multiple virtual machines and geographically distributed users. ...
BibTeX reference
In this paper, we propose an algorithm to solve multi objective optimization problem where the objects under study are graphs. The proposed algorithm is des...
BibTeX referenceA Variance-Based Method to Rank Input Variables of the Mesh Adaptive Direct Search Algorithm
The Mesh Adaptive Direct Search algorithm (MADS) algorithm is designed for nonsmooth blackbox optimization problems in which the evaluation of the funct...
BibTeX reference
This paper proposes a dynamic game model of the process through which countries join international environmental agreements (IEAs). The model assumes that ...
BibTeX reference
Introduced during the late nineties of the last century, Variable Neighborhood Search (VNS) was first designed for solving specific problems in combinatorial...
BibTeX reference
Cloud Computing networks include software components, servers, routers, network links, and data center facilities. Thus, they require a meticulous design tha...
BibTeX reference
Column generation for solving linear programs with a huge number of variables alternates between solving a master problem and a pricing subproblem to add var...
BibTeX reference
We propose a new dynamic row/column management algorithm for the schedule of freight trains in a single/double track railway system. While many works have al...
BibTeX referenceScheduling Issues in Vehicle Routing
Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years...
BibTeX reference
We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and <i>distance signless...
BibTeX reference
One of the major results announced in the static literature on the coordination of pricing decisions in bilateral monopolies states that vertical integrati...
BibTeX reference
Consider a scale that accepts three marbles of different weights. The scale only ranks the marbles, by indicating the heaviest, the lightest and the middle ...
BibTeX reference
The unit commitment problem is a fundamental problem in the operation of power systems. The purpose of unit commitment is to minimize the system-wide cost o...
BibTeX reference
We propose a stochastic dynamic program for valuing options on stock-index futures. The model accounts for deterministic, seasonally varying dividends gene...
BibTeX reference