Axe 2 : Aide à la décision prise dans les systèmes complexes

Retour

Cahiers du GERAD

1412 résultats — page 57 de 71

, et

This paper examines dynamic advertising and promotion strategies in a marketing channel where the retailer promotes the manufacturer's product, and the manu...

référence BibTeX
, , et

Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...

référence BibTeX
, , , et

This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...

référence BibTeX
et

A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...

référence BibTeX

This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...

référence BibTeX
, et

This case study analyses the use and sharing of a logistics package, a returnable container, between Canada Post and its large mailing customers. Canada Po...

référence BibTeX

Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.

référence BibTeX
, et

Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...

référence BibTeX
, et

It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...

référence BibTeX
et

The paper deals with the problem of sustaining over time a coordinated outcome in a two-member channel of distribution. In a dynamic game of pricing and ad...

référence BibTeX
et

Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...

référence BibTeX

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
, , , et

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
, , et

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
et

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
, et

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
et

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
, et

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