Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 60 de 155
The aim of this paper is to compute upper and lower bounds for convex value functions of derivative contracts. Laprise et al. (2006) compute bounds for Ame...
référence BibTeX
This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...
référence BibTeX
We model the role of the world's forests as a major carbon sink and consider the impact that forest depletion has on the accumulation of CO<sub>2</sub> in ...
référence BibTeXFranchise Location Models and Cannibalization Effects: A Variable Neighborhood Search Approach
Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...
référence BibTeX
Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well ...
référence BibTeX
A travelling deliveryman needs to find a tour such that the total waiting time of all the customers he has to visit is minimum. The deliveryman starts his ...
référence BibTeX
Euclidean Minimum Sum-of-Squares Clustering amounts to finding <i>p</i> prototypes by minimizing the sum of the squared Euclidean distances from a set of ...
référence BibTeX
Although General Variable Neighborhood Search (GVNS) is shown to be powerful and robust methodology for solving travelling salesman and vehicle routing pro...
référence BibTeX
Sequential clustering aims at determining homogeneous and/or well-separated clusters within a given set of entities, one at a time, until no more such clus...
référence BibTeX
Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...
référence BibTeX
Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...
référence BibTeX
The past decade has seen advances in general methods for symmetry breaking in mixed-integer linear programming. These methods are advantageous for general ...
référence BibTeX
The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...
référence BibTeX
We consider a two-period closed-loop supply chain (CLSC) game where a remanufacturer appropriates of the returns' residual value and decides whether to exc...
référence BibTeX
In this paper, we provide a decomposition over time of Shapley value for dynamic stochastic discrete-time games, where the uncertainty is described by an eve...
référence BibTeX
Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...
référence BibTeX
Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...
référence BibTeX
Convex nondifferentiable, also known as convex nonsmooth, optimization (NDO) looks at problems where the functions involved are not continuously different...
référence BibTeX
This paper is concerned with computing global optimal solutions for maximum k-cut problems. We improve on the SBC algorithm of Ghaddar, Anjos and Liers in...
référence BibTeX
Shared-segment protection offers a good compromise between shared link and path protection. In this paper, we further investigate segment protection with res...
référence BibTeX