Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1415 results — page 28 of 71
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 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
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
The buffer sizing problem in unreliable production lines is a complex combinatorial optimization problem. In the formulation of the problem, the system consi...
BibTeX reference
While there has been a surge of articles on convergence diagnostic tools for MCMC on continuous stationary distributions and ordinal state spaces, Bayesian c...
BibTeX reference
We investigate geoengineering as a possible substitute for mitigation and adaptation measures to reduce damages from climate change. With the help of an inte...
BibTeX reference
Air traffic in Europe is predicted to increase considerably over the next decades. In this context, we present a study of the interactions between the costs...
BibTeX reference
The improved primal simplex (IPS) was recently developed by Elhalaloui et al. to take advantage of degeneracy when solving linear programs with the primal si...
BibTeX reference
We consider a dynamic closed-loop supply chain made up of one manufacturer and one retailer, with both players investing in a product recovery program to inc...
BibTeX reference
We revisit the relationship between market power and firms' investment incentives in a noncooperative differential oligopoly game in which firms sell diffe...
BibTeX reference