Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1444 results — page 24 of 73

, , and

This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...

BibTeX reference
and

We consider a dynamic game with a corrupt government and multiple civil society organizations as the players. We characterize feedback Stackelberg equilibr...

BibTeX reference
, , , , , and

Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...

BibTeX reference

This paper studies the impact of service level constraints in the context of the capacitated and uncapacitated lot sizing problems with deterministic demand ...

BibTeX reference

Blackbox optimization problems are often contaminated with numerical noise, and direct search methods such as the Mesh Adaptive Direct Search (MADS) algorit...

BibTeX reference
, , and

We present a new derivative-free trust-region (DFTR) algorithm to solve general nonlinear constrained problems with the use of an augmented Lagrangian m...

BibTeX reference
, , , and

We study derivative-free constrained optimization problems and propose a trust-region method that builds linear or quadratic models around the best feasible ...

BibTeX reference

Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...

BibTeX reference
, , and

We consider within the framework of Mean Field Games theory a dynamic discrete choice model with an advertiser, where a large number of minor agents (e.g., c...

BibTeX reference
, , and

We consider a dynamic collective choice problem where a large number of players are cooperatively choosing between multiple destinations while being influenc...

BibTeX reference
and

In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...

BibTeX reference
, , , and

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usual...

BibTeX reference
, , and

NLP.py is a programming environment to model continuous optimization problems and to design computational methods in the high-level and powerful Python l...

BibTeX reference
and

We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...

BibTeX reference
and

The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...

BibTeX reference
and

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), \(GA/\overline{d}\) and \(\Delta\), in terms of the order `...

BibTeX reference
and

In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...

BibTeX reference
, , , and

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

BibTeX reference
, , and

The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...

BibTeX reference
and

Scheduling activities in an underground mine is a very complex task. This paper presents an optimization model for short-term planning that takes into consid...

BibTeX reference