Cahiers du GERAD
Search
Chronological list
3212 results — page 102 of 161
This paper proposes an efficient heuristic to solve the topological design of a next generation optical network that provides fully meshed connectivity betw...
BibTeX reference
In this paper we consider mixed oligopoly markets for differentiated goods where private and public firms compete either in prices or quantities. We then st...
BibTeX reference
The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the v...
BibTeX reference
We present a MILP mathematical programming formulation for static scheduling of dependent tasks onto homogeneous multiprocessor system of an arbitrary archi...
BibTeX referenceOn the Xorshift Random Number Generators
G. Marsaglia introduced recently a class of very fast <i>xorshift</i> random number generators, whose implementation uses three "xorshift" operations. They ...
BibTeX reference
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level ...
BibTeX reference
The objectives of this paper are twofold; we first demonstrate the flexibility of the mesh adaptive direct search (MADS) in identifying locally optimal algo...
BibTeX reference
Different integer linear programming (ILP) formulations have been proposed for the routing and wavelength assignment problem in WDM optical networks, mainl...
BibTeX reference
We present a review of column generation formulations for the Routing and Wavelength Assignment (rwa) problem with the objective of minimizing the blocking r...
BibTeX reference
The continuous location-allocation problem requires finding sites for <i>m</i> new facilities in the plane in order to serve <i>n</i> users such that the to...
BibTeX referenceParallel Variable Neighborhood Search
Variable Neighborhood Search (VNS) is a recent and effective metaheuristic for solving combinatorial and global optimization problems. It is capable of esca...
BibTeX reference
Les problèmes de chargement statique de groupes turbo-alternateurs à vapeur peuvent être exprimés sous forme de minimisation d’une somme de fonction de coût ...
BibTeX reference
Dynamic programming is applied to the economic dispatch problem with spin- ning reserve constraint. A first algorithm, based on a direct application of Bell...
BibTeX reference
This paper introduces the first exact approach for constructing aircrew member personalized monthly work schedules when a preferential bidding system (PBS) ...
BibTeX reference
There are many advantages to taking account of multi-lag autocorrelation of the inflows in a reservoir management problem: the flood and water shortage risk...
BibTeX referenceAnalysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering
The global <i>k</i>-means heuristic is a recently proposed (Likas et al. 2003) incremental approach for minimum sum-of-squares clustering of a set <i>X</i> ...
BibTeX reference
In this paper, we examine the sensitivity of trust-region algorithms on the param- eters related to the step acceptance and update of the trust region. We s...
BibTeX reference
Recent developments in numerical methods for solving large differentiable nonlinear optimization problems are reviewed. State-of-the-art algorithms for solv...
BibTeX reference
We consider the problem of separating two sets of points in an <i>n</i>-dimensional real space with a (hyper)plane that minimizes the sum of <i>L<sub>p</sub...
BibTeX reference
In Duan, Gauthier and Simonato (1999), analytical formulas to approximate the price European options in the GARCH framework were developed. These formulas a...
BibTeX reference