Axe 4 : Aide à la décision prise en temps réel
RetourCahiers du GERAD
109 résultats — page 3 de 6
Clustering is the subject of active research in several fields such as operations research, statistics, pattern recognition, and machine learning. The range ...
référence BibTeX
The purpose of this study is to design incentives for price and advertising coordination in a bilateral monopoly. I prove that a wholesale price reduction ...
référence BibTeX
This paper focuses on designing a state estimator for a discrete-time SEIR epidemic model of an influenza-like illness. It is assumed that only sets of adm...
référence BibTeX
Short-term production scheduling in open pit mining consists of defining the extraction sequence and process allocation of mineralized material over time-sca...
référence BibTeX
As more and more data about mining complex operations is collected and stored, it becomes increasingly important for computer systems to help human operators...
référence BibTeX
Given an integer solution, the integral simplex using decomposition (ISUD) seeks a descent direction that leads to an improved adjacent integer solution. It ...
référence BibTeX
We consider a dynamic game model of ride-sourcing, where a large number of private car owners provide rides to randomly appearing customers. Free drivers c...
référence BibTeX
Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...
référence BibTeX
The problem of output stabilization is studied for a class of linear hybrid systems subject to signal uncertainties: linear impulsive systems under dwell-t...
référence BibTeX
Le problème de la détermination du plus grand sous-graphe \(k\)-colorable (\(k\)-MCSP)
consiste à colorer autant de sommets que possible avec au plus `...
This paper examines the issue of price and advertising coordination in bilateral monopolies from a dynamic perspective. Its main objectives are to design i...
référence BibTeX
In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...
référence BibTeX
Avec les avancées dans l’intégration des énergies renouvelables dans les réseaux électriques, les méthodes de planification stochastiques deviennent des alte...
référence BibTeX
Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...
référence BibTeX
This paper investigates the dynamic pricing strategies of firms selling complementary products in a marketing channel. The problem is modelled as a non-coo...
référence BibTeX
Partout dans le monde, les pratiques de planification des réseaux électriques sont en mutation dans le but d'intégrer de manière efficace un parc de producti...
référence BibTeX
Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring is an assignment of at most `...
We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...
référence BibTeX
This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...
référence BibTeX
Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...
référence BibTeX