Cahiers du GERAD
Search
Chronological list
3237 results — page 70 of 162
The Small Octagons of Maximal Width
The paper answers an open problem introduced by Bezdek and Fodor in 2000. The width of any unit-diameter octagon is shown to be less than or equal to `(\fra...
BibTeX reference
Current network planning and design methods use the average delay, packet loss and throughput as metrics to optimize the network cost and performance. New...
BibTeX reference
In IP-over-WDM networks, protection can be offered at the optical layer or at the IP layer. Today, it is well acknowledged that synergies need to be develope...
BibTeX reference
We present ACRE, an Automatic aspeCt cREator, to use aspect-oriented programming to test multi-platform software programs written in C++. ACRE allows devel...
BibTeX reference
This paper develops a dynamic risk management model to determine a firm's optimal risk management strategy. This strategy has two elements: first, for low ...
BibTeX referenceBranch-Price-and-Cut for Creating an Annual Delivery Program of Multi-Product Liquefied Natural Gas
In this paper a new branch-price-and-cut method for a maritime inventory routing problem for one of the world's largest producers of liquefied natural gas (L...
BibTeX referenceAn Experimental Study on Load-Peak Shaving in Smart Homes by Means of Online Admission Control
This paper presents the design, implementation, and the first experimental results of an architecture for autonomous demand-side load management (ADSM) syste...
BibTeX reference
A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such that the sum of the weights of ed...
BibTeX reference
In this article we study a network design problem that arises in the exploitation of wind energy. We formulate this problem as a mixed integer programming ...
BibTeX reference
This paper presents a framework to determine optimal maintenance planning of a fleet of complex and independent systems. They are made up of several major co...
BibTeX reference
The inventory routing problem (IRP) and the production routing problem (PRP) are two difficult problems arising in the planning of integrated supply chains...
BibTeX reference
Interior-point methods in semi-definite programming (SDP) require the solution of a sequence of linear systems which are used to derive the search directions...
BibTeX referenceSum-of-Squares Clustering on Networks
Finding <i>p</i> prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in cluste...
BibTeX referenceOptimization of Algorithms with OPAL
OPAL is a general-purpose system for modeling and solving algorithm optimization problems. OPAL takes an algorithm as input, and as output it suggests para...
BibTeX referenceOptimal Location of Data Centers and Software Components in Cloud Computing Network Design
Given Cloud Computing geographical distribution on multiple regions, the location of data centers, servers and software components and the way information is...
BibTeX reference
Implementations of the Simplex method differ only in very specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer ...
BibTeX reference
Wavelets have been successfully used for nonparametric function estimation, but a major challenge in density and hazard estimation is that the function must ...
BibTeX reference
Although stochastic programming is probably the most effective frameworks for handling decision problems that involve uncertain variables, it is always a cos...
BibTeX reference
The problem of coordinating a fleet of vehicles so that all demand points on a territory are serviced and that the workload is most evenly distributed among ...
BibTeX reference
Our main interest is the prediction of future events for recurrent event processes. We intend to build a Bayesian model, based on sound philosophical princip...
BibTeX reference