Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1368 résultats — page 32 de 69
We consider a duopoly competing in quantity, where firms can invest in both innovative and absorptive R&D to reduce their unit production cost, and where t...
référence BibTeX
We investigate the dynamic effect that the Tandroy's unsustainable practices have on the forest. The Tandroy people lives in Androy, a region located in th...
référence BibTeX
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the or...
référence BibTeX
The Job Grouping Problem consists of assigning a set of jobs, each with a specific set of tool requirements, to machines with a limited tool capacity in orde...
référence BibTeX
Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...
référence BibTeX
The min-max <i>k</i>-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle in order to find a set of b...
référence BibTeX
Modularity maximization is extensively used to detect communities in complex networks. It has been shown however that this method suffers from a resolution l...
référence BibTeX
We study the problem of packing equal circles in a square from the mathematical programming point of view. We discuss different formulations, we analyse fo...
référence BibTeX
In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E <b>83</b>, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the...
référence BibTeX
Organizational behavior and stakeholder processes continually influence energy strategy choices and decisions. Although theoretical optimizations can provide...
référence BibTeX
Climate change is one of the greatest challenges facing our planet in the foreseeable future and despite the urgency of the situation global GHG emissions ...
référence BibTeX
We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...
référence BibTeXThe Normalized Revised Szeged Index
In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several varian...
référence BibTeX
Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...
référence BibTeX
We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nonde...
référence BibTeX
In this article we address the model order reduction problem for resistor networks by using methods from graph theory. We formulate this problem through gr...
référence BibTeX
Soit \(G\)
un graphe connexe, \(n\)
l'ordre de \(G\)
, et \(f\)
(resp. \(t\)
)
l'ordre maximum d'une forêt induite (resp. d'un arbre induit) dans
`...
We propose an interior-point algorithm based on an elastic formulation of the \(\ell_1\)
-penalty merit function for mathematical programs with complementar...
Carbon leakage and competitiveness concerns are some of the main reasons why an international environmental agreement is lacking to fight climate change. M...
référence BibTeXDegeneracy of Harmonic Means Clustering
It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....
référence BibTeX