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

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

Projected Krylov methods are full-space formulations of Krylov methods that take place in a nullspace. Provided projections into the nullspace can be compute...

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

The paper surveys the literature on cooperative advertising in marketing channels (supply chains) using game theoretic methods. During the last decade in p...

We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...

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

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

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

Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years...

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

One of the major results announced in the static literature on the coordination of pricing decisions in bilateral monopolies states that vertical integrati...