Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1415 results — page 31 of 71

, , , and

We use a newly developed bottom-up model of the entire Canadian energy system (TIMES-Canada) to assess potentials for electrification of the road transport s...

BibTeX reference

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-fi rst-out (LIFO) loading constr...

BibTeX reference
and

In this paper we study a class of N -player finite-horizon linear-quadratic difference games with linear constraints. We introduce a specific information...

BibTeX reference
and

In this paper, we study N -player finite-horizon discrete-time dynamic stochastic games where the uncertainty is described by an event tree. We consider ...

BibTeX reference
, , and

Variable neighborhood search (VNS) is a meta-heuristic for solving optimization problems, whose basic idea is a systematic change of neighborhood structure...

BibTeX reference
and

Symmetric quasi-definite systems may be interpreted as regularized linear least-squares problem in appropriate metrics and arise from applications such as re...

BibTeX reference
, , and

First-generation R&D-based endogenous growth models have been criticized because they predict strong scale effects (growth rate proportional to the size of...

BibTeX reference
and

We propose a new numerical method for evaluating long-maturity American put options. Most existing numerical approaches are based on the time discretization...

BibTeX reference
and

Why private labels (PLs) enjoy a large market in some countries while hardly penetrating others? What makes a market favourable to PL-product development? A...

BibTeX reference
and

The distance Laplacian of a connected graph G is defined by L = Diag(Tr) - D, where D is the distance matrix of G , and Diag(Tr) is the diagonal m...

BibTeX reference
, , and

We describe the most recent evolution of our constrained and unconstrained testing environment and its accompanying SIF decoder. Code-named SIFDecode and CU...

BibTeX reference

Dantzig-Wolfe reformulation solved by Column Generation is an approach to obtain improved bounds for Mixed Integer Programs. A downside of this approach is t...

BibTeX reference
, , and

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
, , , and

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
and

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 reference
, , and

The Mesh Adaptive Direct Search algorithm (MADS) algorithm is designed for nonsmooth blackbox optimization problems in which the evaluation of the funct...

BibTeX reference
and

This paper proposes a dynamic game model of the process through which countries join international environmental agreements (IEAs). The model assumes that ...

BibTeX reference
, , and

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

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