Cahiers du GERAD
Search
Chronological list
3212 results — page 44 of 161
This paper presents a new high-order, non-stationary sequential simulation approach, aiming to deal with the typically complex, curvilinear structures and hi...
BibTeX reference
This paper examines the issue of price and advertising coordination in bilateral monopolies from a dynamic perspective. Its main objectives are to design i...
BibTeX reference
We study derivative-free constrained optimization problems and propose a trust-region method that builds linear or quadratic models around the best feasible ...
BibTeX referenceDynamic 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...
BibTeX reference
Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...
BibTeX reference
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...
BibTeX referenceDynamic 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...
BibTeX reference
In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...
BibTeX reference
An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usual...
BibTeX reference
NLP.py is a programming environment to model continuous optimization problems and to design computational methods in the high-level and powerful Python l...
BibTeX referenceA 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 ...
BibTeX reference
The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...
In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), \(GA/\overline{d}\) and \(\Delta\), in terms of the order `...
In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...
In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems and apply ...
BibTeX referenceA 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...
BibTeX reference
This work presents Visual PeRF-Mesh, a tool that addresses the performance analysis and simulation of Advanced Metering Infrastructure (AMI) RF-mesh smart...
BibTeX reference
Due to the limited applicability of the classical job shop scheduling problem in practice, many researchers have been addressing more complex versions of thi...
BibTeX reference
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...
BibTeX reference
Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...
BibTeX reference