Menouar Boulif

Menouar Boulif

Auto-generated profile, based on publicly available information

Menouar Boulif

M’hamed Bougara University of Boumerdes

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2006 in Computers & Operations Research
Verified
Journal Article
Closed access
MBMenouar Boulif
Menouar Boulif
KAKarim Atif
Karim Atif

1 October 2010
Verified
Conference Paper
Closed access
BMBoulif Menouar
Boulif Menouar
This paper presents an insight on genetic algorithm (GA) encoding representations applied to graph partitioning problems. Redundancy and blindness, two important features that have a direct impact on the performance of the method, are theoretically investigated and some conclusions are drawn.

29 February 2008 in International Journal of Approximate Reasoning
Verified
Journal Article
Closed access
MBMenouar Boulif
Menouar Boulif
KAKarim Atif
Karim Atif

25 April 2023 in International Journal of Communication Systems
Verified
Journal Article
Closed access
ONOukas Nourredine
Oukas Nourredine
BMBoulif Menouar
Boulif Menouar
ECEric Campo
Eric Campo
ABAdrien van Den Bossche
Adrien van Den Bossche

1 January 2015 in European J. of Industrial Engineering
Verified
Journal Article
Closed access
SMSabrina Merchichi
Sabrina Merchichi
MBMenouar Boulif
Menouar Boulif
This paper deals with the manufacturing cell formation (MCF) problem, which is based on group technology (GT) principles, by using a graph-theoretic model. Due to the exponential nature of the problem, various heuristics and meta-heuristics have been proposed to solve it. However, only few studies have attempted to develop exact algorithms. In this paper, we develop two B&B algorithms, taking into account the actual constraints of production. The first algorithm is based on the notion of co-cycles (cuts) in the generation of solutions. The second has a similar structure, except that it is improved by using the constraints. The obtained results of the two algorithms are reported for medium-sized instances. [Received 6 December 2013; Revised 10 March 2014; Accepted 3 August 2014]