Un graphe est dit sans &ok si aucun de ses sommets nâ€™est adjacent a trois sommets formant un stable. Les graphes adjoints sont des graphes sans 6toile. Le problitme de la recherche dâ€™un stable deâ€¦ (More)

A bull is the graph obtained from a triangle by adding two pendant vertices adjacent to distinct vertices of the triangle. Chv~tal and Sbihi showed that the strong perfect graph conjecture holds forâ€¦ (More)

A graph is said to be h-perfect if the convex hull of its independent sets is defined by the constraints corresponding to cliques and odd holes, and the nonnegativity constraints. Seriesparallelâ€¦ (More)

We show that there are, up to a trivial equivalence, precisely six theorems of the following form: If the vertices of a graph G are coloured red and white in such a way that no chordless path withâ€¦ (More)

In a container terminal, the optimal operations management faces many constraints, which makes it a complex and challenging problem. The main objective of this paper is to solve a real-lifeâ€¦ (More)

2016 11th International Conference on Intelligentâ€¦

2016

This paper deals with the problem of minimizing the completion time of unloading containers from a train in the logistical platform MITA in Casablanca/Morocco. The main objective is to solve aâ€¦ (More)