Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1415 results — page 26 of 71

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

BibTeX reference
and

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

BibTeX reference
and

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

BibTeX reference
and

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

BibTeX reference

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , , and

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
, , , and

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

BibTeX reference
, , , and

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
, , and

This paper proposes an incentive mechansim for transmission expansion planning. The mechansim is a bilevel program. The upper level is a profit-maximizing tr...

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , , and

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

BibTeX reference