Cahiers du GERAD
Recherche
Liste chronologique
3212 résultats — page 44 de 161
This paper presents a new high-order, non-stationary sequential simulation approach, aiming to deal with the typically complex, curvilinear structures and hi...
référence BibTeX
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
We study derivative-free constrained optimization problems and propose a trust-region method that builds linear or quadratic models around the best feasible ...
référence BibTeXDynamic programming and parallel computing for valuing two-dimensional american-style options
We propose a dynamic program coupled with finite elements for valuing two-dimensional American-style options. To speed-up our procedure, we use parallel comp...
référence BibTeX
La création d’horaires de personnel aériens est généralement effectuée en deux étapes : la création de rotations d’équipage, suivie par la création d’horaire...
référence BibTeX
We consider within the framework of Mean Field Games theory a dynamic discrete choice model with an advertiser, where a large number of minor agents (e.g., c...
référence BibTeXDynamic collective choice: Social optima
We consider a dynamic collective choice problem where a large number of players are cooperatively choosing between multiple destinations while being influenc...
référence BibTeX
In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...
référence BibTeX
An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usual...
référence BibTeX
NLP.py constitue un écosystème de programmation simplifiant le développement d'algorithmes d'optimisation dans un langage de haut-niveau aussi puissant ...
référence BibTeXA Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...
référence BibTeX
L'indice géométrique-arithmétique \(GA\) d'un graphe \(G\) est la somme des ratios, sur l'ensemble des arêtes de \(G\), de la moyenne géométrique sur l...
Dans le présent article, nous démontrons des bornes inférieure et supérieure sur chacun des rapports \(GA/\delta\), \(GA/\overline{d}\) et \(\Delta\), ...
Dans le présent article, nous comparons l'indice géométrique-arithmétique \(GA\) et le nombre chromatique \(\chi\) d'un graphe connexe d'ordre donné. Ent...
In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems and apply ...
référence BibTeXA Java-based simulation tool for the performance analysis of large-scale wireless mesh networks
Driven by the need of robust, cost-effective, and ready-to-use solutions to connect wirelessly thousands to million of nodes, an increasing number of applica...
référence BibTeX
This work presents Visual PeRF-Mesh, a tool that addresses the performance analysis and simulation of Advanced Metering Infrastructure (AMI) RF-mesh smart...
référence BibTeX
Due to the limited applicability of the classical job shop scheduling problem in practice, many researchers have been addressing more complex versions of thi...
référence BibTeX
In this paper, we propose a new scheme for building algorithms to detect communities in networks. This new approach is based upon a vertex centrality measur...
référence BibTeX
Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...
référence BibTeX