Cahiers du GERAD
Search
Chronological list
3237 results — page 96 of 162
This paper addresses the structural optimization of a next generation optical, lattice based, yottabit-per-second transport network topology, called the <i>...
BibTeX reference
In [<i>SIAM J. Optim.</i>, 17 (2006), pp. 188–217] Audet and Dennis proposed the class of <i>mesh adaptive direct search algorithms</i> (MADS) for minimizat...
BibTeX reference
The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated ve...
BibTeX reference
We use a stylized gas system to study the use of access-to-gas storage in a seasonal model. In a duopoly setting, we find that welfare is higher under vert...
BibTeX referenceComparing the Zagreb Indices
Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with <img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and <img src="/cgi-bin/...
BibTeX reference
Given a simple connected graph <i>G = (V,E)</i> the geodetic closure <i>I [S]</i> <img src="/cgi-bin/mimetex.cgi?\subset"> <i>V</i> of a subset <i>S</i...
BibTeX reference
In this paper, we develop an efficient algorithm to price options under discrete time GARCH processes. We propose a procedure based on dynamic programming c...
BibTeX reference
This paper presents a new method for the probabilistic logic satisfiability problem, based on the variable neighborhood search metaheuristic. The solution s...
BibTeX reference
This paper addresses the problem of determining the daily operating policy of a reservoir over a one-year period that satisfies conflicting objectives regar...
BibTeX reference
This paper considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also reque...
BibTeX reference
We suggest new heuristic for solving unconstrained continuous optimization problems. It is based on generalized version of the variable neighborhood search m...
BibTeX referenceOn Calibration Estimation for Quantiles
In this paper, we consider the estimation of quantiles using the calibration paradigm. The proposed methodology relies on an approach similar to the one lea...
BibTeX referenceMathematical Programming Formulations for the Design of Convolutional Self-Doubly Orthogonal Codes
Convolutional Self-Doubly Orthogonal Codes (CSO<sup>2</sup>C) have been introduced in 1998 by Haccoun et al. as a novel class of convolutional codes which c...
BibTeX referenceThe Jackknife Revisited: Feature Selection in Linear Programming Approaches to Credit Scoring
We discuss feature selection approaches within the context of linear programming models for discrimination, with special emphasis on a new interpretation an...
BibTeX referenceExplicit Martingale Representations for Brownian Functionals and Applications to Option Hedging
Using Clark-Ocone formula, explicit martingale representations for path-dependent Brownian functionals are computed. As direct consequences, explicit martin...
BibTeX reference
We study the problem of routing and wavelength assignment (RWA) in a WDM optical network under different hop assumptions, i.e., with and without wavelength ...
BibTeX reference
Dans un contexte de gestion journalière, on dispose le plus souvent d’une prévision météorologique déterministe pour calculer les apports futurs probables a...
BibTeX reference
We propose a game-theoretic model involving the manufacturer of a national brand and a retailer selling her private label along with the national brand. The...
BibTeX reference
We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels...
BibTeX referenceTesting for Equality Between Two Copulas
We develop a test of equality between two dependence structures estimated through empirical copulas. We provide inference for independent or paired samples....
BibTeX reference