Decentralized stochastic control refers to the multi-stage optimization of a dynamical system by multiple controllers that have access to different informati...

In decentralized control systems with linear dynamics, quadratic cost, and Gaussian disturbance (also called decentralized LQG systems) linear control strate...

Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

The Tube Challenge consists of visiting all stations of the London Underground in the least possible time. The competition started in 1959 and the current r...

The airline crew scheduling problem has received extensive attention, particularly in the last sixty years. This problem is frequently divided into crew pair...

Le laplacien sans signe des distances d'un graphe connexe \(G\) est défini par \(\mathcal{D}^\mathcal{Q} = Diag(Tr) + \mathcal{D}\), où \(\mathcal{D}\)...

La proximité \(\pi\) et l'éloignement \(\rho\) sont respectivement le minimum et le maximum, pour les sommets d'un graphe connexe, de la distance moyenne...

Air traffic in Europe is predicted to increase considerably over the next decades. In this context, we present a study of the interactions between the costs...

Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so hav...

Since the 1970's, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an ...

The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many dom...

In 1971, Graham and Pollack established a relationship between the number of negative eigenvalues of the distance matrix and the addressing problem in data c...

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

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

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

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 consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...

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

We consider multi-antenna base stations using orthogonal frequency-division multiple access and space division multiple access techniques to serve single-a...

We derive conditions on the functions \(\varphi\), \(\rho\), \(v\) and \(w\) such that the 0-1 fractional programming problem`(\max\limits_{x\in {0...