Cahiers du GERAD
Search
Chronological list
3083 results — page 49 of 155
The randomized Condorcet voting system
In this paper, we introduce the randomized Condorcet voting system. Our main contribution is to present it as a natural extension of Condorcet's ideas, hence...
BibTeX reference
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...
BibTeX reference
In this paper, we propose a differential game model with a coupled constraint to represent the possible effects of climate agreements between industrialized,...
BibTeX referenceUmbrella-branding spillovers
In this paper, we extend the classical market-share attraction model to a multi-category setting to include umbrella-branding spillover. Our starting conject...
BibTeX referenceThe Tube Challenge
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...
BibTeX reference
The airline crew scheduling problem has received extensive attention, particularly in the last sixty years. This problem is frequently divided into crew pair...
BibTeX referenceTime-ahead pricing of energy supply
This report proposes two electricity pricing strategies for the Major of an American town of 16,000 people. An implementation with the AIMMS software is pres...
BibTeX reference
Various constrained problem formulations for the optimization of an electro-thermal wing anti-icing system in both running-wet and evaporative regimes are pr...
BibTeX reference
In many large engineering design problems, it is not computationally feasible or realistic to store Jacobians or Hessians explicitly. Matrix-free implementat...
BibTeX reference
In this paper, we introduce a new measure of social fairness based on unfairness feelings of the players involved in an allocation problem, e.g., cake-cuttin...
BibTeX reference
The distance signless Laplacian of a connected graph \(G\)
is defined by \(\mathcal{D}^\mathcal{Q} = Diag(Tr) + \mathcal{D}\)
, where \(\mathcal{D}\)
is...
Proximity \(\pi\)
and remoteness \(\rho\)
are respectively the minimum and the maximum, over the vertices of a connected graph, of the average distance f...
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...
BibTeX reference
Global asset optimization aims to simultaneously optimize mine production schedules, destination policies and the various processing streams in order to maxi...
BibTeX referenceTwo-stage stochastic surface constrained mine production scheduling with pit discretization
This paper addresses the optimization of long-term mine production schedules, building upon a previous stochastic integer programming (SIP) formulation based...
BibTeX reference
Traditional short-term production planning is carried out in two separate sequential optimizations, typically based on mixed integer programming formulations...
BibTeX reference
Mining operations are highly affected by risk, commodity price and geology being acknowledged as the most relevant risk factors. Considering these uncertaint...
BibTeX reference
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...
BibTeX reference
This paper presents a distributed and dynamic programming framework to the mining rate target tracking of multiple mines under financial uncertainty. A singl...
BibTeX reference