Given a directed graph \(G=(V,A)\), capacity and cost functions on \(A\), a root \(r\), a subset \(T \subset V\) of terminals, and an integer \(k\)...

L'étude des réseaux de télécommunications sans-fil pour cellulaire est importante, car ceux-ci consomment beaucoup d'énergie et ont un impact non négligeable...

Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...

Metros and other rapid transit systems increase the mobility of urban populations while decreasing congestion and pollution. There are now 187 cities with a ...

In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with ...

The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...

The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...

Soient \({\mathcal D(G)}\), \({\mathcal D}^L(G)={\mathcal Diag(Tr)} - {\mathcal D(G)}\) et \({\mathcal D}^Q(G)={\mathcal Diag(Tr)} + {\mathcal D(G)}\),...

Soit \(G\) un graph d'ordre \(n\). L'énergie \(\mathcal{E}(G)\) d'un graph simple \(G\) est la somme de des valeurs absolues des valeurs propres de s...

We consider a dynamic game model of ride-sourcing, where a large number of private car owners provide rides to randomly appearing customers. Free drivers c...

The airline crew scheduling problem, because of its size and complexity, is usually solved in two phases: the crew pairing problem and the crew assignment pr...

We consider a static team problem in which agents observe correlated Gaussian observations and seek to minimize a quadratic cost. It is assumed that the ob...

On considère un jeu dynamique représentant un canal de distribution formé d'un manufacturier et d'un détaillant où la demande dépend du prix et de la réputat...

Nous donnons des conditions nécessaires et suffisante pour l'existence d'un graphe simple, ou d'un graphe connexe simple, ayant des nombres donnés `(m_{ij}...

The object of study in the recent theory of Mean Field Games has been primarily large populations of agents interacting through a population dependent coupli...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\) are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

Étant donné un graphe \(G\) complet, orienté, avec des poids sur les sommets et les arcs, une \(k\)-coloration \(\theta\)-impropre de \(G\) est une...

Dans cet article, nous nous intéressons à létude des valeurs propres du laplacien des distances d'un graphe connexe d'ordre \(n\) et de nombre chromatique ...

Le problème de la détermination du plus grand sous-graphe \(k\)-colorable (\(k\)-MCSP) consiste à colorer autant de sommets que possible avec au plus `...