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

Various disturbances such as adverse weather conditions may result in delayed or canceled flights and affect the optimized schedules planned for airline crew...

This paper considers a family of cutting planes, recently developed for mixed 0-1 polynomial programs and shows that they define facets for the maximum edge-...

In prior works, this group demonstrated the feasibility of valid adaptive sequential designs for crossover bioequivalence studies. In this paper, we extend t...

Pressure on ancillary reserves in power systems has significantly mounted due to the recent generalized increase of the fraction of (highly fluctuating) wi...

The types of constraints encountered in black-box and simulation-based optimization problems differ significantly from those treated in nonlinear programmin...

It is well known that the mixed linear complementarity problem can be used to model the equilibrium in energy markets as well as a host of other engineering ...

Nous considérons un jeu stochastique joué sur un arbre d'événements, et supposons que les joueurs sont d'accord pour former la grande coalition et maximiser ...

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