Cahiers du GERAD
Search
Chronological list
3212 results — page 24 of 161
While one can exploit the storage properties and thus the deferability or anticipation potential of many classes of power system loads (such as thermal loads...
BibTeX reference
This work considers the graph partitioning problem known as maximum k-cut. It focuses on investigating features of a branch-and-bound method to efficiently...
BibTeX reference
Given a set \(\mathcal{R}\) of m disjoint finite regions in the 2-dimensional plane, all regions having polygonal boundaries, and given a set `(\mathc...
It is well known that the integrated optimization of multiple and inter-related decisions in a supply chain can bring important benefits to companies. In thi...
BibTeX reference
The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...
BibTeX reference
Quebec and Canada at large face difficult challenges to adapt and compete in the upcoming data driven economy. Many analysts already consider the game to be ...
BibTeX reference
Networked protection systems use information, communication and computation technologies to collect and process sensor data from spatially distributed sensor...
BibTeX reference
Wireless communications can facilitate transfer of synchrophasor data between spatially separated phasor measurement units (PMUs) and phasor data concentrato...
BibTeX referenceSpectral properties of threshold graphs
In this paper we study the spectral properties of the threshold graphs. In particular, we give lower and upper bounds for the largest and smallest eigenvalue...
BibTeX reference
In this paper we consider a differentiated oligopoly with two product varieties that are supplied by two groups of firms. We assume that firms can change t...
BibTeX reference
Free-Floating Carsharing (FFCS) systems are a promising concept to reduce the traffic volume in cities. However, spatial and temporal mismatches of supply an...
BibTeX reference
The solution to a biobjective optimization problem is composed of a collection of trade-off solution called the Pareto set. The present work studies the que...
BibTeX reference
The energy of a graph \(G\), denoted by \({\cal E}(G)\), is defined as the sum of the absolute values of all eigenvalues of \(G\). In this paper we stu...
Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...
BibTeX reference
The energy landscape is marked by a rapid emergence of electricity prosumers at all levels of the grid. While energy policy seems to be more adaptive to the ...
BibTeX reference
Mineral value chains or mining complexes involve mining, processing, stockpiling, waste management, and transportation activities. An integrated stochastic...
BibTeX reference
With sufficient layers, enough training data, enough time, and often a custom tailored architecture, modern deep learning methods can be extremely successf...
BibTeX reference
A new mathematical model for stochastic short-term optimization of mining complexes is presented that simultaneously optimizes the short-term extraction sequ...
BibTeX reference
Deploying applications having many processes in a multi-cloud environment is challenging. The cloud manager has goals such as minimizing power consumption, w...
BibTeX reference
The standard blending problem consists of combining components to produce a final product with a given demand, while satisfying specific criteria with resp...
BibTeX reference