We study the Capacity Constrained Lot Size Problem with Setup Times (CLST). Based on two strong reformulations of the problem, we present a transformed refor...

In this article we introduce the Quadratic Capacitated Vehicle Routing Problem (QCVRP), a combinatorial optimization problem that arises in practical applica...

This paper proposes a state-of-the-art branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (VRPSD). We adapt the model of ...

This paper proposes a heuristic approach based on network flow techniques to schedule the production in open-pit mines, while accounting for metal uncertaint...

In the literature, the study of price subsidies of new technologies has focused on the tactical problem of achieving maximum penetration under a budget con...

This paper presents an analysis of Canadian energy and climate policies in terms of the coherence between federal and provincial/territorial strategies. Afte...

In this paper we present a comparative study of several strategies that can be applied to achieve the so-called elementary lower bound in vehicle routing p...

Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need maintenance regularly to keep the...

We compare the use of price-based policies or taxes, and quantity-based policies or quotas, for controlling emissions in a dynamic setup when the regulator...

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...

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...

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

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 ...

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

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

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

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

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...

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...

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