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

The first part of this two-part paper developed the framework for characterizing the feasibility regions of power systems in the demand space. This character...

This two-part paper presents a framework for the characterization and minimal representation of the feasibility regions of power systems in the demand space....

An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The **dominating induced matchin...

This paper presents a structured approach to model logical constraints (expressions that contain propositions and logical operators) in a linear program usin...

A new algorithm for the optimal stope design problem is proposed. It is based on a previous methodology developed by Bai et al. (2013a) where a cylindrical ...

This paper provides an overview of the role, past, present and future, of demand-side management and demand-side response in electric grids. We address the f...

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

Advanced meter infrastructures (AMIs) are now widespread and their importance within smart grid systems continues to increase with the advent of new applicat...

Unit commitment problem (UCP) for thermal units consists of finding an optimal electricity production plan for a long time horizon. In this paper we propose ...

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

The p-hub median problem consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between th...

In this paper we study the periodic maintenance problem: given a set of m machines and a horizon of T periods, find indefinitely repeating itself mainten...

Large size optimization problems are usually successfully solved by using some metaheuristic approach. Nowadays, there is a trend to combine several metaheur...

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 propose two new diving heuristics for finding a feasible solution for a mixed integer programming problem, called _variable neighbourhood (...

We examine the requirements and the available methods and software to provide (or imitate) uniform random numbers in parallel computing environments. In this...