# Smart infrastructure (telecommunications, public transport, smart cities)

Back## Cahiers du GERAD

### 338 results — page 4 of 17

There has been a lot of interest recently on the energy efficiency and environmental impact of wireless networks. Given that the base stations are the netw...

BibTeX reference

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

BibTeX referenceThe design of rapid transit networks

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

Let `\({\mathcal D(G)}\)`

, `\({\mathcal D}^L(G)={\mathcal Diag(Tr)} - {\mathcal D(G)}\)`

and `\({\mathcal D}^Q(G)={\mathcal Diag(Tr)} + {\mathcal D(G)}\)`

b...

Let `\(G\)`

be a graph of order `\(n\)`

. The energy `\(\mathcal{E}(G)\)`

of a simple graph `\(G\)`

is the sum of
absolute values of the eigenvalues of its ...

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

BibTeX reference

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

BibTeX referenceStatic teams with common information

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

BibTeX reference

We consider a dynamic marketing channel comprising of one manufacturer and one retailer, where consumer demand depends on price and on brand reputation. We...

BibTeX reference

Necessary and sufficient conditions are provided for the existence of a simple
graph, or a simple connected graph with given
numbers `\(m_{ij}\)`

of edges ...

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

BibTeX reference

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph `\(G\)`

are the spectra of the distance, distance Laplacian and...

On the nullity number of graphs

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

Given a complete directed graph `\(G\)`

with weights on the vertices and on the arcs, a `\(\theta\)`

-improper `\(k\)`

-coloring of `\(G\)`

is an assignment of...

In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order `\(n\)`

and chromatic number ...

The maximum `\(k\)`

-colorable subgraph problem (`\(k\)`

-MCSP) is to color as many vertices as possible with at most `\(k\)`

colors, such that no two adjacent...

Network characterization and modelling is an important issue to understand and monitor IP network performance, in particular for real-time multimedia appli...

BibTeX reference