Branch-and-bound and PSO algorithms for no-wait job shop scheduling A AitZai, B Benmedjdoub, M Boudhar Journal of Intelligent Manufacturing 27, 679-688, 2016 | 54 | 2016 |
A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking A AitZai, B Benmedjdoub, M Boudhar International Journal of Operational Research 14 (3), 343-365, 2012 | 32 | 2012 |
2-distance colorings of integer distance graphs B Benmedjdoub, I Bouchemakh, É Sopena Discussiones Mathematicae Graph Theory 39 (2), 589-603, 2019 | 10 | 2019 |
Incidence choosability of graphs B Benmedjdoub, I Bouchemakh, É Sopena Discrete Applied Mathematics 265, 40-55, 2019 | 5 | 2019 |
Incidence choosability of graphs B Benmedjdoub, I Bouchemakh, E Sopena, Â Sopena arXiv preprint arXiv:1705.01744, 2017 | 3 | 2017 |
Strong incidence colouring of graphs B Benmedjdoub, É Sopena Discussiones Mathematicae Graph Theory, 2021 | 2 | 2021 |
On the list incidence chromatic number of graphs B Benmedjdoub, E Sopena, I Bouchemakh Bordeaux Graphs Workshop, BGW 16, 2016 | 2 | 2016 |
Colorations d’incidences B Benmedjdoub | 1 | 2018 |
Job shop avec contraintes de blocage et de sans attente B Benmedjdoub Alger, 2010 | | 2010 |