Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1368 résultats — page 56 de 69
This note determines a rule to share a surplus gained when two countries or regions agree to coordinate their policies to reduce downstream pollution. An in...
référence BibTeXIncentive 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 ...
référence BibTeX
Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...
référence BibTeX
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...
référence BibTeX
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é...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...
référence BibTeX
Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...
référence BibTeX
We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...
référence BibTeX
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...
référence BibTeX
The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...
référence BibTeX
Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...
référence BibTeX
We study empirically the topology of the local minima of the 3-SAT problem. In particular, we analyze the size of the plateaus, their altitude, their attrac...
référence BibTeX
The problem of assigning locomotives to trains consists of selecting the types and number of engines that minimize the fixed and operational locomotive cost...
référence BibTeX
An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...
référence BibTeXÉtude des différentes pratiques de l'ingénierie concourante: une enquête dans l'industrie québécoise
Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...
référence BibTeX