Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 109 de 155
On Uniform k-Partition Problems
We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...
référence BibTeXCharacteristic Functions, Coalitions Stability and Free-riding in a Game of Pollution Control
We consider a set of countries that wish to sign an international agreement to control pollution. The problem is studied from the perspective of cooperativ...
référence BibTeX
This chapter deals with the regulator design problem for the class of jump linear systems. Optimal regulator design, suboptimal regulator with time-multipli...
référence BibTeXSuboptimal Regulators for Discrete Time Jump Linear System with Time-Multiplied Performance Index
This paper addresses the suboptimal regulator design problem of discrete-time jump linear system by using time-multiplied performance index. For a given st...
référence BibTeXA General Multi-Shift Scheduling System
Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...
référence BibTeX
Global climate change issue raises two basic questions: What to do to guarantee the long-term efficiency (or the least collective cost) of international gre...
référence BibTeXGraphs 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...
référence BibTeX
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...
référence BibTeX
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
référence BibTeXAnalysis 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...
référence BibTeXOn 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...
référence BibTeX
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...
référence BibTeXPanchromatic 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...
référence BibTeX
In this paper, the problem of optimally controlling production in a single part unreliable, manufacturing flow line, subjected to a constant rate of demand ...
référence BibTeXIntegral Complete Split Graphs
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
référence BibTeX
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...
référence BibTeX
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...
référence BibTeXAmbulance 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...
référence BibTeX
This paper introduces a new kind of operational crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight depart...
référence BibTeX
Eugène is a sophisticated mixed integer linear programming model developed to help regional decision makers on long-term planning for solid waste management...
référence BibTeX