Cahiers du GERAD
Search
Chronological list
3083 results — page 36 of 155
A dynamic-material-value-based decomposition method for mineral supply chain optimization
A decomposition method is developed to optimize a mineral value chain composed of a one or multiple mines and a material flow circuit. In the proposed decomp...
BibTeX referenceA stochastic optimization formulation for the transition from open pit to underground mining
As open pit mining of a mineral deposit deepens, the cost of extraction may increase up to a threshold where transitioning to mining through underground meth...
BibTeX reference
High-order sequential simulation techniques for complex and non-Gaussian spatially distributed variables were developed over the last few years. This paper p...
BibTeX referenceOptimizing a multi-pit mining complex with intricate blending requirements under supply uncertainty
Mineral value chains consist of material from multiple sources, several processing streams, and transportation systems that combine to generate various salea...
BibTeX reference
Over the past several years, there has been substantial progress in developing new stochastic mine planning optimization models and computationally efficient...
BibTeX reference
Network characterization and modelling is an important issue to understand and monitor IP network performance, in particular for real-time multimedia appli...
BibTeX reference
Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...
BibTeX reference
Clustering addresses the problem of finding homogeneous and well-separated subsets, called clusters, from a set of given data points. In addition to the poi...
BibTeX reference
This paper develops an international-trade game with two locally regulated producers. They may freely export but have to sell in their local market at a pric...
BibTeX reference
The \(k\)
-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of
heuristics based on location-allocation steps that ...
The balanced clustering problem consists of partitioning a set of \(n\)
objects into \(K\)
equal-sized clusters as long as
\(n\)
is a multiple of `(K...
Lévy processes provide a solution to overcome the shortcomings of the lognormal hypothesis. A growing literature proposes the use of pure-jump Lévy processe...
BibTeX referencePower capacity profile estimation for building heating and cooling in demand side management
This paper presents a new methodology to estimate power capacity profiles for smart buildings. The capacity profile can be used within a demand side manage...
BibTeX reference
When dealing with node or link failures in Software Defined Networking (SDN), the network capability to establish an alternative path depends on controller r...
BibTeX reference
In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...
BibTeX reference
For positive definite linear systems (or semidefinite consistent systems), we use Gauss-Radau quadrature to obtain a cheaply computable upper bound on the ...
BibTeX reference
This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...
BibTeX reference
We consider a dynamic game with a corrupt government and multiple civil society organizations as the players. We characterize feedback Stackelberg equilibr...
BibTeX reference
We propose the option realized variance as a new observable covariate that integrates high frequency option prices in the inference of option pricing models....
BibTeX reference
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