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

Back## Cahiers du GERAD

### 338 results — page 5 of 17

Dynamic collective choice: Social optima

We consider a dynamic collective choice problem where a large number of players are cooperatively choosing between multiple destinations while being influenc...

BibTeX reference

In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...

BibTeX reference

The geometric-arithmetic index `\(GA\)`

of a graph `\(G\)`

is the sum of ratios, over all edges of `\(G\)`

, of the geometric mean to the arithmetic mean of t...

In the present paper, we prove lower and upper bounds for each of the ratios `\(GA/\delta\)`

, `\(GA/\overline{d}\)`

and `\(\Delta\)`

, in terms of the order `...

In the present paper, we compare the geometric-arithmetic index `\(GA\)`

and the chromatic number `\(\chi\)`

of a connected graph with given order. We prove,...

Inspired by successful biological collective decision mechanisms such as honey bees searching for a new colony or the collective navigation of fish schoo...

BibTeX reference

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...

BibTeX reference

Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...

BibTeX referenceMean field linear quadratic teams

In this paper, we investigate team optimal control of a population of heterogeneous LQ (Linear Quadratic) agents. The population consists of finite distinct...

BibTeX reference

In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision on the airc...

BibTeX reference

In this article, we tackle the conflict resolution problem using a new variant of the minimum weight maximum clique model. The problem consists in identifyi...

BibTeX reference

We consider a multi-agent system with linear stochastic individual dynamics, and individual linear quadratic ergodic cost functions. The agents partially o...

BibTeX reference

Decentralized sequential hypothesis testing refers to a generalization of Wald's sequential hypothesis testing setup in which multiple decision makers make ...

BibTeX reference

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

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

-improper `\(k\)`

-coloring is an assignment of at most `...

Fundamental limits of remote estimation of Markov processes under communication constraints

The fundamental limits of remote estimation of Markov processes under communication constraints are presented. The remote estimation system consists of a sen...

BibTeX reference

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation *p*-hub center problem (USApHCP). F...

The uncapacitated multiple allocation *p*-hub center problem (UMApHCP) consists of choosing *p* hub locations from a set of nodes with pairwise traffic deman...

Sequential variable neighborhood descent variants: An empirical study on Travelling salesman problem

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

BibTeX reference

In this paper we investigate the options of a network operator faced with the requirement of reducing its carbon footprint, expressed in terms of a global en...

BibTeX reference

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

BibTeX reference