Cahiers du GERAD
Search
Chronological list
3237 results — page 107 of 162
<i>Tabucol</i> is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a fixed number <i>k</...
BibTeX reference
This paper discusses a Bayesian functional estimation method, based on Fourier series, for the estimation of the hazard rate from randomly right-censored dat...
BibTeX reference
Two ways for bounding <i>n</i>-variables functions over a box, based on interval evalu- ations of first order derivatives, are compared. The optimal Baumann...
BibTeX referenceAsymptotic Efficiencies of the Sign and the Wilcoxon Signed-Rank Tests for Cluster Correlated Data
In this paper, we study the Pitman asymptotic efficiencies of the sign and the Wilcoxon signed-rank tests for cluster correlated data. A general expression ...
BibTeX reference
This paper presents algorithms to find vertex-critical and edge-critical subgraphs in a given graph <i>G</i>, and demonstrates how these critical subgraphs ...
BibTeX referenceCutting Stock Problems
Linear relaxations are solved by column generation. Stabilization techniques such as dual-optimal inequalities and stabilized column generation algorithms t...
BibTeX reference
We propose a Dynamic Programming (DP) approach combined with approximation for pricing options embedded in bonds, the focus being on call and put options wit...
BibTeX reference
Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...
BibTeX reference
The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on r...
BibTeX referenceExact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem
In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delive...
BibTeX reference
This paper deals with the control of the class of uncertain hybrid stochastic systems. The uncertainties we are considering are of norm bounded type. The st...
BibTeX reference
We study whether the introduction of a private label could be profitable for retailers and manufacturers. We also investigate if cooperative advertising cou...
BibTeX reference
In this work we propose to use a continuous Variable Neighborhood Search (VNS for short) heuristic for minimizing the potential energy function of molecules...
BibTeX reference
This paper presents some new heuristics based on variable neighborhood search to solve the vertex weighted <i>k</i>-cardinality tree problem. An efficient l...
BibTeX reference
We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level locati...
BibTeX reference
This paper reports on the on-going development of a hybrid approach for dispatching and conflict-free routing of automated guided vehicles used for material...
BibTeX reference
We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem i...
BibTeX reference
The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task gra...
BibTeX reference
In this note we explore the fact that a stationary point of some nonlinear non-convex optimization problem is not always a local optimum, and that such a st...
BibTeX reference
This paper deals with the topological design of a yotta-bit-per-second (1 <i>yotta</i> = 10<sup>24</sup>) multidimensional network. The YottaWeb is a recent...
BibTeX reference