Deux colorations des sommets d'un graphe sont dites équivalentes si elles correspondent à la même partition de l'ensemble des sommets en classes de couleurs....

Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

Une coloration des arêtes d'un graphe \(G\) est une fonction qui attribue un entier (appelé couleur) à chaque arête de \(G\) de telle sorte que les arête...

L'algorithme RLF (Recursive Largest First) est l'un des plus populaires parmi les heuristiques gloutonnes pour le problème de la coloration des sommets d'un ...

Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. ...

A graph \(G = (V,E)\) is \(r\)-equitably \(k\)-colorable if there exists a partition of \(V\) into \(k\) independent sets `(V1, V2, \ldots, V_k...

We study the number \({\cal{P}}(G)\) of non-equivalent ways of coloring a given graph \(G\). We show some similarities and differences between this graph...

In this paper a new procedure for finding an upper bound on the clique number of a given graph is described. Gendron, Hertz and St-Louis (2008) proposed a se...

In this paper, we study the problem introduced by Baptiste et al. (2011) of minimizing the number of steps to unload a set of boxes off a gravity conveyor. W...

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...

Given a graph <i>G</i>, an integer <i>k</i>, and a cost <i>c_uv</i> associated with all pairs <i>uv</i> of non-adjacent vertices in <i>G</i>, the ...

In this article we study a network design problem that arises in the exploitation of wind energy. We formulate this problem as a mixed integer programming ...

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 `...

An <i>r</i>-equitable <i>k</i>-coloring <i>c</i> of a graph <i>G=(V,E)</i> is a partition of <i>V</i> into <i>k</i> stable sets <img src="/cgi-bin/mimetex.cg...

We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the ...

In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint...

In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated w...

La confection de calendriers sportifs dans le milieu scolaire québécois est une tâche complexe à laquelle la Fédération Québécoise du Sport Étudiant (FQSE) d...

A total dominating set in a digraph <i>G</i> is a subset <i>W</i> of its vertices such that every vertex of <i>G</i> has an immediate successor in <i>W</i>. ...

A <i>k</i>-edge-coloring of a graph <i>G=(V,E)</i> is a function <i>c</i> that assigns an integer <i>c(e)</i> (called color) in <i>{0,1, ..., k-1}</i> to eve...