Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1412 results — page 8 of 71

, , and

A compact operations research (OR) model is proposed to analyse the prospects of meeting the Paris Agreement targets when direct air capture technologies can...

BibTeX reference
, , and

Product recalls are often consequences of quality failures. While such failures are related to a manufacturer's or supplier's design quality, the perceived q...

BibTeX reference
and

It is a challenge to sustain cooperation in a finite-horizon dynamic game. Since players generally have an incentive to deviate to their noncooperative str...

BibTeX reference
, , and

Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem, and on...

BibTeX reference
, , and

This paper presents DCISolver.jl a new Julia package implementating the Dynamic Control of Infeasibility method (DCI), introduced by Bielschowsky & Gomes (20...

BibTeX reference

In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...

BibTeX reference
, , and

A piecewise constant Mayer cost function is used to model optimal control problems in which the state space is partitioned into several regions, each having ...

BibTeX reference
, , and

The use of space through satellites is more and more important for nations, companies, and individuals. However, since the first satellite was sent up in 19...

BibTeX reference
, , , , , , and

This paper presents an efficient method for extracting the second-order sensitivities from a system of implicit nonlinear equations. We design a custom aut...

BibTeX reference
, , and

For a simple connected graph G, let D(G), Tr(G), DL(G)=Tr(G)D(G), and DQ(G)=Tr(G)+D(G) be the distance matrix, the diagonal m...

BibTeX reference

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with n=2m vertices is not known when m7. In this paper, w...

BibTeX reference

The Tenth Montreal IPSW took place on August 13-27, 2020, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for Dat...

BibTeX reference
and

For a graph G, the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) is the adjacency matrix of G and `...

BibTeX reference
and

In this paper we examine the stability of international environmental agreements about a (common) emissions target. By signing the agreement, the parties d...

BibTeX reference
and

The increasingly complex energy systems are turning the attention towards model-free control approaches such as reinforcement learning (RL). This work propos...

BibTeX reference
and

A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with n=2s vertices is not known when s3. T...

BibTeX reference
, , , and

Binary quadratic programming (BQP) is a class of combinatorial optimization problems comprising binary variables, quadratic objective functions and linear/no...

BibTeX reference
and

This paper aims to identify the sources of value created in the strategic plan of a mining complex when the adaptive simultaneous stochastic optimization of ...

BibTeX reference
and

The geometallurgical models that predicting the throughput/comminution performance of the a processing plant often rely on rock hardness models, which are ba...

BibTeX reference
, , and

In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-orde...

BibTeX reference