Cahiers du GERAD
Search
Chronological list
3083 results — page 104 of 155
This paper presents a new branching strategy that is applied on the cost of a subproblem during the solution of a large-scale linear program by a column gene...
BibTeX reference
This paper deals with the issue of deforestation, one of the main global environmental problems. We consider two players having different utilities for fores...
BibTeX reference
Due to the increasing popularity of automated guided vehicles in modern industry and the valuable investment they require, their design and operational issue...
BibTeX reference
This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...
BibTeX reference
Convex feasibility problem in general is a problem of finding a point in a convex set contains a full dimensional ball and is contained in a compact convex ...
BibTeX reference
We examine whether cooperative advertising programs could constitute an effective tool to coordinate competitive marketing channels. While previous studies s...
BibTeX reference
We present a novel exact solution method for the centralized network design problem on directed graphs. The problem is modelled as the well-known graph theo...
BibTeX referencePolynomial Integration Lattices
Lattice rules are quasi-Monte Carlo methods for estimating large-dimensional integrals over the unit hypercube. In this paper, after briefly reviewing key i...
BibTeX reference
This paper explores new ways of constructing and implementing random number generators based on linear recurrences in a finite field with 2<sup><i>w</i></sup...
BibTeX reference
This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...
BibTeX reference
We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...
BibTeX reference
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...
BibTeX referenceThe Network of Logistics Decisions
This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...
BibTeX reference
Several methods for reducing the variance in the context of Monte Carlo simulation are based on correlation induction. This includes antithetic variates, L...
BibTeX reference
We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coeffic...
BibTeX reference
We develop stochastic models of time-dependent arrivals, with focus on the application to call centers. Our models reproduce essential features of call cen...
BibTeX reference
Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.
BibTeX reference
We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assign...
BibTeX reference
We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...
BibTeX reference
This paper deals with the design of a new proposed optical core transport network called the YottaWeb, which offers information delivery at rates thousand of...
BibTeX reference