Cahiers du GERAD
Search
Chronological list
3212 results — page 109 of 161
In this paper we propose a mathematical model for the dimensioning of a 3G multimedia network and design a Tabu Search heuristic to solve it. The model is a...
BibTeX reference
The first part of this paper presents a model of a subway network to evaluate a cost function that includes an operational cost and social costs measured in...
BibTeX reference
A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...
BibTeX reference
Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus...
BibTeX reference
This paper deals with the issue of shelf-space allocation and advertising decisions in marketing channels. We consider a network composed of a unique retaile...
BibTeX referenceThe Minimum Diameter Octagon with Unit-Length Sides: Vincze's Wife's Octagon is Suboptimal
This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...
BibTeX reference
This work is devoted to the study of linear continuous-time systems with Markovian jumping parameters and constrained control. The constraints used in this p...
BibTeX reference
We consider the problem of testing the hypothesis that a multivariate location vector is in the positive orthant. A conditionally distribution-free sign te...
BibTeX reference
The elementary shortest path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle routing and crew scheduling a...
BibTeX referenceGoodness-of-fit Procedures for Copula Models Based on the Integral Probability Transformation
An approach is suggested for testing whether the dependence structure of a random sample of multivariate data is appropriately modelled by a given family of ...
BibTeX reference
In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...
BibTeX reference
This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...
BibTeX reference
Road network monitoring is an activity conducted daily by the Ministry of Transport of Quebec. The complete network must be monitored every two weeks. In th...
BibTeX reference
The Gibbs sampler is a very simple yet efficient method for the performance evaluation of product form loss networks. This paper introduces the setwise Gibb...
BibTeX reference
The autoregressive conditional multinomial model describes vector time series of conditional probabilities, where the variable of interest is multinomial. ...
BibTeX reference
We present stochastic approximation algorithms for computing the locally optimal policy of a constrained average cost finite state Markov Decision process. B...
BibTeX reference
Using an inifinite-horizon two-player differential game, we derive and compare Bertrand and Cournot equilibria, for a differentiated duopoly engaging in proc...
BibTeX reference
The augmenting chain technique has been applied to solve the maximum stable set problem in the class of line graphs (which coincides with the maximum matchin...
BibTeX reference
Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...
BibTeX reference
Given a finite set <i>E</i> and a family <i>F</i>={<i>E</i><sub>1</sub>,...,<i>E<sub>m</sub></i>} of subsets of <i>E</i> such that <i>F</i> covers <i>E</i>...
BibTeX reference