We study the function returning the sum of the k components of largest magnitude of a vector. We show that if a nonnegative vector x is such that its Eu...

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

Le premier volet de cet article en deux parties a développé le cadre nécessaire à la caractérisation des espaces de charge des réseaux électriques. Cette car...

Cet article en deux volets présente un cadre formel pour la caractérisation et la représentation minimale des espaces opérationnels réalisables des réseaux é...

Cet article présente une approche structurée pour modéliser des contraintes logiques (expressions qui contiennent des propositions et des opérateurs logiques...

Dans cet article, on propose un nouvel algorithme pour trouver le contour optimal des chantiers dans les mines souterraines. Il est basé sur une méthodologie...

Cet article dresse un portrait du rôle, passé, présent et futur, des moyens de gestion et de pilotage des charges dans les réseaux électriques. Nous y adress...

We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...

The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

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

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

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

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

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

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

In this paper we show how to robustify the computation of equilibria in two integrated assessment models for climate change. Both models deal with the optima...

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

In this paper, we present a stochastic two-level optimization model whose upper-level problem depicts a wastewater treatment plant deciding on the size of co...