Cahiers du GERAD
Search
Chronological list
3212 results — page 113 of 161
Recent Trends in Arc Routing
Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...
BibTeX reference
We present a simple algorithm that finds a nonnegative solution to a system of linear inequalities. This algorithm can be taught to secondary or college leve...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX referenceBIPA -- 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...
BibTeX referenceA 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...
BibTeX referenceVariable 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...
BibTeX reference
The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...
BibTeX reference
This paper deals with the class of uncertain continuous-time linear systems with Markovian jumps, time-delay, and saturating actuators. Under norm-bounded u...
BibTeX reference
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...
BibTeX reference
We investigate the effects of retailer's myopic behavior on channel members strategies and on sales in a single-manufacturer single-retailer distribution ne...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference