Dans cet article, nous introduisons le scrutin de Condorcet randomisé. Notre principale contribution est de le présenter en tant qu'extension naturelle des i...

Including employee preferences in a shift-scheduling scheme raises the question of how to aggregate employee satisfactions in a sensible manner. To do so, we...

In this paper, we propose a differential game model with a coupled constraint to represent the possible effects of climate agreements between industrialized,...

Dans cet article, nous proposons une extension du modèle d'attraction de parts de marché dans un cadre multi-catégories dans le but de considérer l'effet de ...

The Tube Challenge consists of visiting all stations of the London Underground in the least possible time. The competition started in 1959 and the current r...

The airline crew scheduling problem has received extensive attention, particularly in the last sixty years. This problem is frequently divided into crew pair...

Ce rapport propose deux stratégies de fixation des prix de l'électricité pour un maire d'une petite ville américaine de 16 000 habitants. Une implémentation ...

Various constrained problem formulations for the optimization of an electro-thermal wing anti-icing system in both running-wet and evaporative regimes are pr...

Dans de nombreuses applications réelles d'ingénierie, il est impossible de stocker les Jacobiens ou les Hessiens de manière explicite. L'implémentation de mé...

Dans cet article, nous introduisons une nouvelle mesure d'équité dans un problème d'allocations, e.g., un problème de partage de gâteaux ou de construction d...

Le laplacien sans signe des distances d'un graphe connexe \(G\) est défini par \(\mathcal{D}^\mathcal{Q} = Diag(Tr) + \mathcal{D}\), où \(\mathcal{D}\)...

La proximité \(\pi\) et l'éloignement \(\rho\) sont respectivement le minimum et le maximum, pour les sommets d'un graphe connexe, de la distance moyenne...

Given a linear program (LP ) with m constraints and n lower and upper bounded variables, any solution \(x^0\) to LP can be represented as a nonne...

In this article, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloa...

Global asset optimization aims to simultaneously optimize mine production schedules, destination policies and the various processing streams in order to maxi...

This paper addresses the optimization of long-term mine production schedules, building upon a previous stochastic integer programming (SIP) formulation based...

Traditional short-term production planning is carried out in two separate sequential optimizations, typically based on mixed integer programming formulations...

Mining operations are highly affected by risk, commodity price and geology being acknowledged as the most relevant risk factors. Considering these uncertaint...

The optimization of open-pit mine production scheduling (OPMPS) is an intricate process due to its size and uncertainty of key input parameters. Over the las...

This paper presents a distributed and dynamic programming framework to the mining rate target tracking of multiple mines under financial uncertainty. A singl...