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

In this paper we present a novel experimental platform for network management able to dynamically optimize the energy consumption of backbone IP networks ope...

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

Attractive travelling salesman problem (AtTSP) consists of finding maximal profit tour starting and ending at a given depot after visiting some of the faci...

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

The integer least squares problem is an important problem that arises in numerous applications. We propose a real relaxation-based branch-and-bound (RRBB) ...

In the present paper, we are interested in studying mathematical properties of the Balaban index of connected graphs. We present a discussion on and refuta...

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

Transmission and betweenness centrality are key concepts in communication networks theory. In this paper, a series of network descriptors based on betweenne...