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

Retour

Cahiers du GERAD

1444 résultats — page 34 de 73

, et

Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequ...

référence BibTeX
, , , et

This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...

référence BibTeX
, et

We model the role of the world's forests as a major carbon sink and consider the impact that forest depletion has on the accumulation of CO<sub>2</sub> in ...

référence BibTeX
, et

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

référence BibTeX

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well ...

référence BibTeX
, , , et

Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...

référence BibTeX
et

Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...

référence BibTeX
et

We consider a two-period closed-loop supply chain (CLSC) game where a remanufacturer appropriates of the returns' residual value and decides whether to exc...

référence BibTeX
, et

In this paper, we provide a decomposition over time of Shapley value for dynamic stochastic discrete-time games, where the uncertainty is described by an eve...

référence BibTeX

Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...

référence BibTeX
, et

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

référence BibTeX
et

This work introduces the use of the treed Gaussian process (TGP) as a surrogate model within the mesh adaptive direct search (MADS) framework for constrain...

référence BibTeX

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

référence BibTeX
, et

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

référence BibTeX
et

The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...

référence BibTeX
, et

We consider a problem of groundwater management in which a group of farmers overexploits a groundwater stock and causes excessive pollution. A Water Agency...

référence BibTeX
et

In the absence of an international environmental agreement (IEA) on climate change, a country may be reluctant to unilaterally implement environmental acti...

référence BibTeX
, et

Dynamic constraint aggregation (DCA) and dual variable stabilization (DVS) are two methods that can reduce the negative impact of degeneracy when solvi...

référence BibTeX
, et

Stochastic programming can yield significant savings over deterministic approaches. For example, the stochastic approach for the shift scheduling problem sol...

référence BibTeX
, et

Dispersion problems consist of the selection of a fixed number of vertices from a given set so that some function of the distances among the vertices is maxi...

référence BibTeX