Cahiers du GERAD
Search
Chronological list
3212 results — page 130 of 161
We present an algorithm for variational inequalities <i>VI</i>( <img src="G9756.gif" align=bottom>,<i>Y</i>) that is based on the Analytic Center Cutting Pl...
BibTeX reference
We analyze the process of a two cut generation scheme in the analytic center cutting plane method. We propose an optimal restoration direction when the two...
BibTeX reference
We present a general methodology to study the electricity market of a country or region, under various pricing mechanisms. The approach is based on modifica...
BibTeX reference
We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...
BibTeX referencePerformability of a Congested Urban Transportation Network when Accident Information is Available
This paper presents a framework to assess a performability measure in a urban transportation network given the possibility of an accident condition. This fr...
BibTeX reference
Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel resetting of an urban network has to be done in...
BibTeX reference
We consider a managerial economics problem of controlling pollution caused by decentralised agents. We build a mathematical model for a local government ai...
BibTeX reference
We propose a greedy heuristic and a Tabu Search type heuristic for channel block assignment subject to co-channel, adjacent channel, co-site constraints as ...
BibTeX reference
One of the main advantages of the discrete wavelet representation is the near-optimal estimation of signals corrupted with noise. After the seminal work of ...
BibTeX reference
In this paper, we study the moments of cumulative processes. More specifically, we will evaluate explicitly the expectation of a product of <i>n</i> distinc...
BibTeX referenceCovering a Graph with Cycles
This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...
BibTeX reference
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. The technique consists of building an increasingly refine...
BibTeX reference
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...
BibTeX reference
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...
BibTeX reference
A combinatorial approach is used to derive asymptotic expressions for arbitrary moments of cumulative vector renewal reward processes, as the time horizon <...
BibTeX reference
An econometric model is developed and used to estimate price promotion effects on sales for the yogourt category in a Quebec market. More specifically, the...
BibTeX reference
This paper classifies research contributions on decomposition approach for solving mathematical programming problems. More than 60 papers are presented with...
BibTeX reference
In this paper we investigate the quadratic stability and quadratic stabilizability of the class of continuous-time linear systems with Markovian jumps and n...
BibTeX referenceVariable Neighbourhood Search
Systematic change of neighborhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a ...
BibTeX reference
This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...
BibTeX reference