Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 83 de 155
In this paper we analyze the trade-off between admission costs and receiver rewards of TCP Tahoe flows competing for buffer space. Since the buffer space is...
référence BibTeXOn a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems
Given a graph <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> with strictly positive integer weights <img src="/cgi-bin/mimetex.cgi?\omega_i"> on the vertices <img ...
référence BibTeXDiscrete-Time Survival Trees
Tree-based methods are frequently used in studies with censored survival time. Their structure and ease of interpretability make them useful to identify p...
référence BibTeX
Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible v...
référence BibTeX
Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...
référence BibTeX
For every stochastic simulation model, there is in theory a way of changing the probability laws that drive the system so that the resulting IS estimator h...
référence BibTeX
The asymptotic robustness of estimators as a function of a rarity parameter, in the context of rare-event simulation, is often qualified by properties such a...
référence BibTeX
We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...
référence BibTeX
In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...
référence BibTeX
Here we study hierarchical Bayesian estimation of a monotone hazard rate for both complete and randomly right censored data. We propose two methods of comp...
référence BibTeX
<p>The paper determines optimal pricing and advertising policies for an entertainment event, taking into account diffusion effects and a last-minute market...
référence BibTeX
<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>
<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...
référence BibTeX
In Z. Ma, P.E. Caines, and R.P. Malhamé, ``Control of Loss Network Systems: Call Admission and Routing Control", (submitted to <i>SIAM J. Control...
référence BibTeX
In this paper the call admission control (CAC) and routing control (RC) problems for loss network systems are studied as optimal stochastic control (OSC) pr...
référence BibTeXVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...
référence BibTeX
This paper deals with the class of linear systems with random abrupt changes. The stochastic stability and the stochastic stabilization problems of t...
référence BibTeX
To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We...
référence BibTeX
In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...
référence BibTeX
Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures
Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...
référence BibTeX