Cahiers du GERAD
Search
Chronological list
3237 results — page 117 of 162
Graphs with Maximum Connectivity Index
Let <i>G</i> be a graph and <i>d<sub>v</sub></i> the degree (= number of first neighbors) of its vertex <i>v</i>. The connectivity index of <i>G</i> is <img...
BibTeX reference
A variant of method of centers for convex optimization is considered. Given an upper bound on the objective function, the algorithm searches for an "approx...
BibTeX reference
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
BibTeX referenceAnalysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon GPS class of pattern search methods for linearly constrained optimization. The ana...
BibTeX referenceOn the Design of Fault-Tolerant Logical Topologies in Wavelength-Routed Networks Supporting IP Flows
In this paper we illustrate a new methodology for the design of fault-tolerant logical topologies in wavelength-routed optical networks exploiting wavelengt...
BibTeX reference
In this paper, a fast and complete method to constructively enumerate fusenes and benzenoids is given. It is fast enough to construct several million non is...
BibTeX referencePanchromatic Chains and Paths
A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...
BibTeX reference
In this paper, the problem of optimally controlling production in a single part unreliable, manufacturing flow line, subjected to a constant rate of demand ...
BibTeX referenceIntegral Complete Split Graphs
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
BibTeX reference
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...
BibTeX reference
This paper presents an analysis of the forward link capacity of a cellular network, based on IS-95 CDMA technology. The forward link, or downlink, refers to...
BibTeX referenceAmbulance Location and Relocation Models
This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...
BibTeX reference
This paper introduces a new kind of operational crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight depart...
BibTeX reference
Eugène is a sophisticated mixed integer linear programming model developed to help regional decision makers on long-term planning for solid waste management...
BibTeX reference
La problématique du changement climatique implique des efforts globaux à long terme et la participation des pays en développement est requise pour assurer l...
BibTeX reference
This paper deals with dispatching systems in open-pit mines. It illustrates the different strategies that exist for solving the dispatching problem and ana...
BibTeX reference
This paper presents a multi-commodity network design approach to solve the problem of simultaneously locating I/O stations and determining the orientation o...
BibTeX reference
The problem of estimating a binomial proportion constrained to lie in an interval of the form [<i>a,b</i>] "not equal to" [0,1] is considered. The minimax ...
BibTeX reference
Although airlines plan aircraft routes and crew schedules in advance, perturbations occur everyday. As a result, flight schedules may become infeasible and ...
BibTeX referenceExact Analysis of a Paired Sibling Study
A data set on categories of congenital heart malformations for sibling pairs (with different malformations) of Fraser and Hunter (1975) is analyzed exactly ...
BibTeX reference