In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

This paper proposes an incentive mechansim for transmission expansion planning. The mechansim is a bilevel program. The upper level is a profit-maximizing tr...

Robust optimization (RO) is a powerful mean to handle optimization problems where there is a set of parameters that are uncertain. The effectiveness of the m...

Studies of traffic dynamics rely either on macroscopic models considering the traffic as a fluid, or on microscopic models of drivers' behavior. The connec...

The problem of optimal real-time transmission of a Markov source under constraints on the expected number of transmissions is considered, both for the discou...

The packet delay variation, commonly called delay jitter, is an important quality of service parameter in IP networks especially for real-time applications. ...

Jitter buffering is a key component in multimedia and real-time services. A jitter buffer is used at the receiver side to control packet rate and to compensa...

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