Cahiers du GERAD
Recherche
Liste chronologique
3170 résultats — page 111 de 159
We consider linear programming relaxations for the max cut problem in graphs, based on <i>k</i>-gonal inequalities. We show that the integrality ratio for ra...
référence BibTeX
We propose a test to detect multivariate ARCH effects in the residuals from a multivariate regression model. The absence of ARCH effects implies that the s...
référence BibTeX
Finding augmenting chains is in the heart of the maximum matching problem, which is equivalent to the maximum stable set problem in the class of line graphs...
référence BibTeX
We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...
référence BibTeX
The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...
référence BibTeX
In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...
référence BibTeX
The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...
référence BibTeX
In this paper, nonparametric tests are presented for the hypothesis of no direct treatment effects, as well as for the hypothesis of no carryover effects, f...
référence BibTeXBIPA -- BIlevel Programming with Approximation Methods) -- Software Guide and Test Problems
This paper describes BIPA, a software for solving nonlinear bilevel programming problems. At each iteration, the underlying algorithm computes a linear-quad...
référence BibTeXA Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience
We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, <i>i.e.</i>, bilevel programs involving line...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity Index
Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...
référence BibTeX
The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...
référence BibTeX
This paper deals with the class of uncertain continuous-time linear systems with Markovian jumps, time-delay, and saturating actuators. Under norm-bounded u...
référence BibTeX
We prove that amongst all fullerenes the dodecahedron has maximum smallest eigenvalue (equal to -<img src="G0234-1.gif" align=middle>), followed by the thre...
référence BibTeX
We investigate the effects of retailer's myopic behavior on channel members strategies and on sales in a single-manufacturer single-retailer distribution ne...
référence BibTeX
We ask whether young agents prefer to work in different-age or same-age production pairs in an overlapping-generations model where wages are reputation-base...
référence BibTeX
A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses th...
référence BibTeX
This paper deals with the class of uncertain systems with multiple time-delays. The stability and stabibizability of this class of systems are considered. T...
référence BibTeX
This paper deals with the class of continuous-time linear systems with Markovian jumps and multiple time-delays. The systems we are treating are assumed to ...
référence BibTeX
The paper identifies optimal dynamic marketing strategies in a channel of distribution. A number of (identical) retailers promote locally a manufacturer's b...
référence BibTeX