Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1401 résultats — page 57 de 71
In this paper, we prove that the maximum <i>k</i>-club problem defined on an undirected graph is NP-hard. We also give an integer programming formulation f...
référence BibTeX
The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...
référence BibTeX
This article is a survey of heuristics for the <i>Vehicle Routing Problem</i>. It is divided into two parts: classical and modern heuristics. The first pa...
référence BibTeX
A new local search heuristic, called J-MEANS, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solut...
référence BibTeX
This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single...
référence BibTeX
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from loc...
référence BibTeX
The paper identifies the strategic effects of learning-by-doing in presence of unintended spillovers of production experience. In a two-stage game an incum...
référence BibTeX
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...
référence BibTeX
This paper focuses on accelerating strategies used in conjunction with column generation to solve Vehicle Routing and Crew Scheduling problems. We describ...
référence BibTeX
Over the last thirty-five years several heuristics have been proposed for the <i>Vehicle Routing problem</i>. This article reviews the main classical heuris...
référence BibTeX
In recent years several <i>metaheuristics</i> have been proposed for the <i>Vehicle Routing Problem</i>. This article reviews the main metaheuristics for th...
référence BibTeX
The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties ...
référence BibTeX
Let <i>G</i> be a simple graph and <i>C</i> and <i>D</i> two proper colourings of <i>G</i>. The problem of colour switching consists of finding a sequence ...
référence BibTeX
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