Cahiers du GERAD
Recherche
Liste chronologique
3237 résultats — page 95 de 162
Stabilization of Singular Markovian Jump Systems with Discontinuities and Saturating Inputs
In this paper, the problem of stability and stabilization of Markov jumping singular systems with discontinuities and saturating inputs is addressed. The de...
référence BibTeXIsoperimetric Polygons of Maximal Width
The value <img src="/cgi-bin/mimetex.cgi?\frac{1}{2n} \cot\left( \frac{\pi}{2n}\right)"> is shown to be an upper bound on the width of any <i>n</i>-sided p...
référence BibTeXEfficient Correlation Matching for Normal-Copula Dependence when Univariate Marginals Are Discrete
A popular approach for modeling dependence in a finite-dimensional random vector <b>X</b> with given univariate marginals is via a normal copula that fits t...
référence BibTeX
We introduce <i>TestU01</i>, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical te...
référence BibTeXUsing Topology Aggregation for Efficient Segment Shared Protection Solutions in Multi-Domain Network
The dynamic routing problem for Overlapped Segment Shared Protection in multi-domain networks has not received a lot of interest so far as it is more difficu...
référence BibTeX
In one-to-one <i>Pickup and Delivery Problems</i> (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in o...
référence BibTeX
We consider a marketing channel where a retailer sells, along the manufacturer’s brand, her own private label. We assume that each player invests in adverti...
référence BibTeX
A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. The independence number &alpha is ...
référence BibTeX
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...
référence BibTeX
From the pentagon onwards, the area of the regular convex polygon with <i>n</i> sides and unit diameter is greater for each odd number <i>n</i> than for the...
référence BibTeX
We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have be...
référence BibTeX
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in th...
référence BibTeX
Importance sampling (IS) is the primary technique for constructing reliable estimators in the context of rare-event simulation. The asymptotic robustness of...
référence BibTeX
The fastest long-period random number generators currently available are based on linear recurrences modulo 2. So far, software that provides multiple disjo...
référence BibTeX
Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed...
référence BibTeX
The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 23. On the Randic Index and the Chromatic Number
Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with vertex degrees <img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...
référence BibTeX
We consider stochastic dynamic games in large population conditions where multiclass agents are weakly coupled via their individual dynamics and costs. We a...
référence BibTeXDevelopments in Differential Game Theory and Numerical Methods: Economic and Management Applications
This paper argues that the literature applying differential games in economics and management science has aimed to a large extent for analytical results. On...
référence BibTeXA Review and Comparative Analysis of Several Asymmetric Travelling Salesman Problem Formulations
In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...
référence BibTeX