Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1420 results — page 9 of 71

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

This work is in the context of blackbox optimization where the functions defining the problem are expensive to evaluate and where no derivatives are availabl...

BibTeX reference
, , and

We study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds of controls. W...

BibTeX reference

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...

BibTeX reference
, , and

In this paper, we apply flexibility-based operational planning method to microgrid (MG) unit commitment (UC). The problem is formulated based on model predi...

BibTeX reference
and

A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with n=2s vertices is not known when `(s ...

BibTeX reference

The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which amounts to maximizing a quadratic function of binary variables,...

BibTeX reference
and

This article presents a novel stochastic optimization model that simultaneously optimizes the short-term extraction sequence, shovel relocation, scheduling o...

BibTeX reference
and

An innovative strategic mine planning approach is applied to a multi-mine and multi-process gold mining complex that simultaneously considers feasible capita...

BibTeX reference

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...

BibTeX reference
, , , and

NOMAD is software for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic...

BibTeX reference
, , and

To satisfy a rising demand, agricultural practices have shifted from the organic fertilization of soils to intensive and highly specialized farming that uses...

BibTeX reference

We consider the problem of scheduling maintenance for a collection of machines under partial observations when the state of each machine deteriorates stochas...

BibTeX reference