Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1368 résultats — page 36 de 69
Let <i>G</i> be a connected graph of order <i>n</i>. The algebraic connectivity of <i>G</i> is the second smallest eigenvalue of the Laplacian matrix of <i>G...
référence BibTeX
A crew pairing is a sequence of flights, connections and rests that start and end at a crew base and is assigned to a single crew. The crew pairing problem c...
référence BibTeX
This intentionally short tutorial is an introduction to the main features of AMPL that are relevant to nonlinear optimization model authoring. Pointers are g...
référence BibTeX
We consider a two-player asymmetric differential game of pollution control. One player is non-vulnerable to pollution, or unwilling to consider damages when ...
référence BibTeX
The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose ...
référence BibTeX
As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into the vehicl...
référence BibTeX
The <i>proximity</i> <img src="/cgi-bin/mimetex.cgi?\pi = \pi (G)"> of a connected graph <i>G</i> is the minimum, over all vertices, of the average distance ...
référence BibTeX
This paper presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be de...
référence BibTeX
We address the problem of locating in the plane objects such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundarie...
référence BibTeX
Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...
référence BibTeXVariable Neighborhood Search
Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...
référence BibTeX
Let <i>Q = D + A</i> denote the signless Laplacian matrix of a graph <i>G</i> of order <i>n</i>, where <i>D</i> is the diagonal matrix of the degrees and <i...
référence BibTeXFifty Years of Vehicle Routing
The <i>Vehicle routing Problem</i> (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem". The study of the ...
référence BibTeX
The paper provides a survey of the literature which utilizes dynamic state-space games to formulate and analyze intertemporal, many-decision maker problems i...
référence BibTeX
Given a set of scheduled flights that must be operated by the same aircraft type, the aircraft routing problem (ARP) consists of building anonymous aircraft ...
référence BibTeX
We consider in this paper a duopoly competing in quantities and where firms can invest in R&D to control their emissions. We distinguish between effort carri...
référence BibTeXOn a Conjecture About the Szeged Index
Khalifeh, Yousefi-Azari, Ashrafi and Wagner [European J. Combin. 30 (2009) 1149-1163] conjectured that for a connected graph <i>G</i> on <i>n</i> vertices...
référence BibTeX
The proximity <img src="/cgi-bin/mimetex.cgi?\pi"> of a graph <i>G</i> is the minimum average distance from a vertex of <i>G</i> to all others. Similarly, th...
référence BibTeX
This work analyzes constrained black box optimization in which the functions defining the problem are periodic with respect to some or all the variables. We ...
référence BibTeX
The paper revisits the advertising differential game suggested by G. Leitmann and W. E. Schmitendorf in their paper "Profit Maximization Through Advertising...
référence BibTeX