A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach von KOUIDER, Ahmed, AIT HADDADÈNE, Hacène

Volltext

Mixed graph colouring for unit-time scheduling von Kouider, Ahmed, Ait Haddadène, Hacène, Ourari, Samia, Oulamara, Ammar

Volltext

An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem von Bouzid, Mouaouia Cherif, Aït Haddadene, Hacene, Salhi, Said

Volltext

On P5-free locally split graphs von Issaadi, Hayat, Ait Haddadene, Hacene, Kheddouci, Hamamache

Volltext

On the b-coloring of G−e von Zamime, Mohamed, Kouider, Mekkia, Haddadène, Hacène Ait

Volltext

An extension of adaptive multi-start tabu search for the maximum quasi-clique problem von Djeddi, Youcef, Haddadene, Hacene Ait, Belacel, Nabil

Volltext

On P 5 -free locally split graphs von Issaadi, Hayat, Ait Haddadene, Hacene, Kheddouci, Hamamache

Volltext

An algorithm for coloring some perfect graphs von Haddadène, Hacène Aït, Gravier, Sylvain, Maffray, Frédéric

Volltext

On the quasi-locally paw-free graphs von Ait Haddadene, Hacene, Mechebbek, Meriem

Volltext

Coloring perfect degenerate graphs von Haddadène, Hacène Aït, Maffray, Frédéric

Volltext

Splitting a Giant Tour using Integer Linear Programming von Bouzid, Mouaouia Cherif, Haddadene, Hacene Aït, Salhi, Said

Volltext

On weakly diamond-free Berge graphs von Ait Haddadene, Hacène, Gravier, Sylvain

Volltext