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

Retour

Cahiers du GERAD

1368 résultats — page 47 de 69

Using a two-player differential game approach, this paper deals with the issue of tropical deforestation. The assumption is that developing forestry countri...

référence BibTeX
et

We consider a differential game model for a marketing channel formed by one manufacturer and one retailer. The latter sells the manufacturer's product and ma...

référence BibTeX
, , et

The Atlantic thermohaline circulation (THC) is an important component in the climate system because it strongly influences conditions in the North Atlantic ...

référence BibTeX
, , et

The algebraic connectivity <i>a(G)</i> of a graph <i>G = (V,E)</i> is the second smallest eigenvalue of its Laplacian matrix. Using the AutoGraphiX (AGX) sys...

référence BibTeX
et

Ce document présente un modèle intégrateur de la logistique inverse. Le modèle est générique et peut servir à différents types d’entreprises. Le contexte du...

référence BibTeX
, et

Column Generation (CG) algorithms are instrumental in many areas of applied optimization, where Linear Programs with an enormous number of columns need to ...

référence BibTeX
, et

Chemical graphs, as other ones, are <i>regular</i> if all their vertices have the same degree. Otherwise, they are <i>irregular</i> and it is of interest to...

référence BibTeX

We describe an approach that computes an optimal primal basic solution given an optimal vector of dual multipliers. It consists in restricting the dual prob...

référence BibTeX
et

This article presents a formulation for the job shop problem based on the Dantzig- Wolfe decomposition with a subproblem for each machine. Each subproblem i...

référence BibTeX

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource con...

référence BibTeX

We give a didactic introduction to the use of the column generation technique in linear and in particular in integer programming. We touch on both, the relev...

référence BibTeX

This paper proposes a generalization of the proximal point algorithm using both penalty and trust region concepts. Finite convergence is established while as...

référence BibTeX
, et

A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-De...

référence BibTeX
, , , et

This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...

référence BibTeX
, et

The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should &#64257;nd extrema of a function defined in most...

référence BibTeX
, et

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...

référence BibTeX
, , , et

Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...

référence BibTeX

Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...

référence BibTeX
, et

We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...

référence BibTeX
et

We consider a game where players face environmental constraints. We derive and compare noncooperative, cooperative and umbrella scenarios. In the latter, the...

référence BibTeX