Cahiers du GERAD
Search
Chronological list
3212 results — page 128 of 161
This paper presents the analysis of the optimal production and corrective maintenance planning problem for a failure prone manufacturing system consisting o...
BibTeX reference
This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...
BibTeX reference
We present a new convergence result for the cone partitioning algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimiz...
BibTeX reference
An algorithm based upon the boundary-edges code and the reverse search method is proposed for enumerating non-isomorphic planar simply connected polyhexes. ...
BibTeX reference
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...
BibTeX reference
This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...
BibTeX reference
The locomotive assignment problem is to provide at minimum cost sufficient motive power to pull all the trains of a time tabled schedule. Optimization metho...
BibTeX reference
This paper deals with the inventory-production control problem where the produced items are supposed to be deteriorating with a rate that depends on the sto...
BibTeX referenceChopping Graphs
Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...
BibTeX reference
We present a 0-1 column generation model for channel block assignment in a cellular network, with the objective of minimizing the interference level. Priori...
BibTeX reference
The Steiner Tree Problem in graphs (STP) is well known NP-Hard problem. It has regained attention due to the introduction of new telecommunication technolog...
BibTeX reference
In recent years, several advances have been made towards the solution of stochastic vehicle routing problems (SVRPs). In particular, the Integer <i>L</i>-Sh...
BibTeX reference
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacita...
BibTeX reference
We study the subgradient projection method for convex optimization with Brännlund's level control for estimating the optimal value. We establish global con...
BibTeX reference
A new hybrid algorithm is being introduced for solving Mixed Integer Nonlinear Programming (MINLP) problems which arise from study of many real-life enginee...
BibTeX reference
This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules ...
BibTeX reference
This paper deals with the problem of how to update a telecommunication network economically. We first propose a mixed integer programming model that include...
BibTeX reference
In this article we propose a model for the topological design problem of two-level multitechnology telecommunication networks that includes the optimal loca...
BibTeX referenceAdvanced Bottom-up Modelling for National and Regional Energy Planning in Response to Climate Change
This paper describes an advanced bottom-up approach for modelling the energy-environment sector to study greenhouse gas abatement. Three new features are d...
BibTeX reference
This paper describes the Preferential Bidding Problem solved in the airline industry to construct personalized monthly schedules for pilots and officers. T...
BibTeX reference