Cahiers du GERAD
Search
Chronological list
3083 results — page 73 of 155
A crew pairing is a sequence of flights, connections and rests that start and end at a crew base and is assigned to a single crew. The crew pairing problem c...
BibTeX reference
This paper investigates design methods of protection schemes in survivable WDM networks which use pre-configured protection structures (<i>p</i>-structures) ...
BibTeX reference
This study analyzes the use of neural network to produce accurate forecasts of total bookings and cancellations before departure, of a major rail operator. ...
BibTeX reference
A challenge in many applications of non-parametric curve estimation is that the function must satisfy some (lower and/or upper) variable order constraints (f...
BibTeX reference
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search....
BibTeX referenceMalliavin Calculus and Clark-Ocone Formula for Functionals of a Square-Integrable Lévy Process
In this article, we construct a Malliavin derivative for functionals of a square-integrable Lévy process. The Malliavin derivative is defined via chaos expan...
BibTeX reference
This intentionally short tutorial is an introduction to the main features of AMPL that are relevant to nonlinear optimization model authoring. Pointers are g...
BibTeX reference
We consider a two-player asymmetric differential game of pollution control. One player is non-vulnerable to pollution, or unwilling to consider damages when ...
BibTeX referenceA Variable Neighborhood Search Based Algorithm for Finite-Horizon Markov Decision Processes
This paper considers the application of a Variable Neighborhood Search (VNS) algorithm for finite-horizon (<i>H</i> stages) Markov Decision Processes (MDPs),...
BibTeX reference
The distance energy of a graph <i>G</i> is defined as <img src="/cgi-bin/mimetex.cgi?ED(G) = \sum |\mui |">, where <img src="/cgi-bin/mimetex.cgi?\mu_i"> i...
BibTeX referenceA Unified Modeling and Solution Framework for Pre-Planned Protection in Survivable WDM Networks
<p>The introduction of new applications that require high bandwidth, high service availability and reliability has generated many researches in the design of...
BibTeX reference
In this work we develop new methods and algorithms for building networks with high synchronizability of dynamical processes occurring at their nodes. In addi...
BibTeX reference
This paper evaluates the changes in efficiency and productivity of coal-fired electricity generation of 30 Chinese administrative regions from 1999 to 2007. ...
BibTeX reference
<p>With the increasing concern for global warming, the impact of Internet power consumption is gaining interest. In this paper, we explore, for the first ti...
BibTeX reference
The issue of Internet energy consumption and its contribution to global warming has been gaining importance lately. In this paper we present a compilation of...
BibTeX reference
The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose ...
BibTeX reference
As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into the vehicl...
BibTeX reference
The <i>proximity</i> <img src="/cgi-bin/mimetex.cgi?\pi = \pi (G)"> of a connected graph <i>G</i> is the minimum, over all vertices, of the average distance ...
BibTeX reference
A <i>k</i>-edge-coloring of a graph <i>G=(V,E)</i> is a function <i>c</i> that assigns an integer <i>c(e)</i> (called color) in <i>{0,1, ..., k-1}</i> to eve...
BibTeX reference
This paper presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be de...
BibTeX reference