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

Le changement climatique constitue un défi majeur du 21^e siècle. C'est un phénomène global, transfrontalier s'inscrivant dans un horizon de temps ...

Cloud Computing applications are inherently oriented to send and receive information between multiple virtual machines and geographically distributed users. ...

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

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

Introduced during the late nineties of the last century, Variable Neighborhood Search (VNS) was first designed for solving specific problems in combinatorial...

Cloud Computing networks include software components, servers, routers, network links, and data center facilities. Thus, they require a meticulous design tha...

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

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