Cahiers du GERAD
Search
Chronological list
3221 results — page 124 of 162
This paper deals with the problem of how to update telecommunication networks economically. We first propose a mixed integer programming model that includes...
BibTeX referenceIncentive Equilibrium Strategies and Welfare Allocation in a Dynamic Game of Pollution Control
The paper considers two neighboring countries wishing to make a joint effort to control pollution emission. We use a differential game model that includes ...
BibTeX reference
Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...
BibTeX reference
In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones that will ...
BibTeX reference
This paper aims to provide an answer to the still open question, namely who should, if any, lead a marketing channel? To achieve this objective, we conside...
BibTeX reference
We consider an asymmetric duopoly producing a homogeneous commodity and facing a competitive demand. Our model incorporates two asymmetries. The first one i...
BibTeX reference
Coupling with the Modified-Grid Unconstrained Optimization Algorithm we introduced in our previous paper (Cheung and Ng, 1995), we have been able to develop...
BibTeX reference
The spatially inhomogeneous smoothness of the non-parametric density or regression-function to be estimated by non-parametric methods is often modelled by B...
BibTeX reference
Il est généralement reconnu que le processus de découpage électoral doit être à l'abri du gerrymandering et de l'intervention politique. L'utilisation de mé...
BibTeX reference
Given a set of <i>m</i> observations on <i>n</i> variables, an 0(<i>mn</i><sup>2</sup>) algorithm is proposed to find a basis of all affine relations betwee...
BibTeX referenceVariable Neighborhood Search for Extremal Graphs. 4. Chemical Trees with Extremal Connectivity Index
By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established the structure of t...
BibTeX reference
The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. Th...
BibTeX reference
We study the problem of allocation over time of total cost incurred by countries in a cooperative game of pollution reduction. We compute the characteristi...
BibTeX reference
Cellular manufacturing is a promising approach for grouping efficiency in manufacturing systems. Although this problem has been extensively studied in the ...
BibTeX referenceOptimization of a Class of Decentralized Hedging Policies in a Stochastic Two-Machine Flow Shop
This paper deals with the optimal production control problem in a stochastic two-machine flow shop. Our aim is to develop approximation techniques for deriv...
BibTeX reference
The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...
BibTeX reference
We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...
BibTeX reference
In a graph <i>G</i>, a <i>k-club</i> is a vertex set inducing a subgraph of diameter <i>k</i>. These structures play an important role in several applicati...
BibTeX reference
Given a network modeled by a probabilistic graph <i>G =</i> (<i>V,E</i>) with bounds on the operation probabilities of edges and of pairs of edges, the seco...
BibTeX reference
Solving exactly large instances of the channel assignment problem often requires to solve large linear programs with respect to the number of columns or row...
BibTeX reference