Infrastructures intelligentes (télécommunications, transport public, villes intelligentes)
RetourCahiers du GERAD
332 résultats — page 11 de 17
Variable Neighborhood Search for Extremal Graphs. 23. On the Randic Index and the Chromatic Number
Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with vertex degrees <img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...
référence BibTeXComparing the Zagreb Indices
Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with <img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and <img src="/cgi-bin/...
référence BibTeX
Given a simple connected graph <i>G = (V,E)</i> the geodetic closure <i>I [S]</i> <img src="/cgi-bin/mimetex.cgi?\subset"> <i>V</i> of a subset <i>S</i...
référence BibTeX
The AutoGraphiX research program led to a new type of application of metaheuristics in graph theory, <i>i.e.</i>, finding conjectures on graph invariants by...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 18. Conjectures and Results about the Randic Index
Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form <img src="/cgi-bin/mimetex.cgi?lbn \leq R \oplus i \leq ub...
référence BibTeX
Colour image quantization is a data compression technique that reduces the total set of colours in an image to a representative subset. This problem is expr...
référence BibTeX
In the integrated aircraft routing, crew scheduling and flight retiming problem, a minimum-cost set of aircraft routes and crew pairings must be constructed...
référence BibTeX
In this paper, we study the problem of determining the capacity requirements for applications that require QoS guarantees. We consider three kinds of source ...
référence BibTeX
Given buses of different types arriving at a depot during the evening, the bus parking problem consists of assigning these buses to parking slots in such a w...
référence BibTeX
We consider the problem of locating a circle with respect to existing facilities on the plane, such that the largest weighted distance between the circle and...
référence BibTeX
In this article we consider the problem of assigning parking slots to buses of different types so that the required buses can be dispatched easily in the mo...
référence BibTeXOn a Conjecture About the Randic Index
A conjecture of Delorme, Favaron and Rautenbach [DM 257 (2002) 29-38] about the Randic index of a graph, in relation to its order and minimum degree, is ref...
référence BibTeXSet covering and packing formulations of graph coloring: algorithms and first polyhedral results
We consider two (0,1)-linear programming formulations of the graph (vertex-) coloring problem, in which variables are associated to stable sets of the input...
référence BibTeX
In a transit authority bus depot, buses of different types arrive in the evening to be parked in the depot for the night, and then dispatched in the morning...
référence BibTeX
We consider a widespread solution method that consists of a column generation approach embedded in a branch-and-bound scheme to solve the multiple depot veh...
référence BibTeX
Usual graph classes, such as complete graphs, paths, cycles and stars, frequently appear as extremal graphs in graph theory problems. Here we want to turn t...
référence BibTeX
We consider a crew scheduling problem with preferential bidding in the airline industry. We propose a new methodology based on a graph coloring model and a ...
référence BibTeX
The variable neighborhood search metaheuristic is applied to the primal simple plant location problem and to a reduced dual obtained by exploiting the compl...
référence BibTeX
We consider vehicle routing and crew scheduling problems that involve a lexico- graphic bi-level objective function (for instance, minimizing first the numb...
référence BibTeX
The continuous location-allocation problem requires finding sites for <i>m</i> new facilities in the plane in order to serve <i>n</i> users such that the to...
référence BibTeX