default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBouazza Elbenani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j8]Mehdi El Krari
, Belaïd Ahiod, Bouazza El Benani:
A pre-processing reduction method for the generalized travelling salesman problem. Oper. Res. 21(4): 2543-2591 (2021)- 2020
- [j7]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem. Appl. Artif. Intell. 34(7): 537-549 (2020) - 2018
- [j6]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
Breakout Local Search for the Travelling Salesman Problem. Comput. Informatics 37(3): 656-672 (2018) - 2017
- [j5]Bouchra Karoum, Bouazza Elbenani:
A hybrid clonal algorithm for the cell formation problem with variant number of cells. Prod. Eng. 11(1): 19-28 (2017) - 2016
- [j4]Bouchra Karoum, Noussaima El Khattabi, Bouazza Elbenani, Abdelhakim Ameur El Imrani:
An efficient artificial immune system algorithm for the cell formation problem. J. Comput. Methods Sci. Eng. 16(4): 733-744 (2016) - [j3]Luong Thuan Thanh, Jacques A. Ferland, Bouazza Elbenani, Nguyen Dinh Thuc, Van Hien Nguyen:
A computational study of hybrid approaches of metaheuristic algorithms for the cell formation problem. J. Oper. Res. Soc. 67(1): 20-36 (2016) - [j2]Mohamed Amine El Majdouli, Ismail Rbouh, Saad Bougrine, Bouazza El Benani, Abdelhakim Ameur El Imrani:
Fireworks algorithm framework for Big Data optimization. Memetic Comput. 8(4): 333-347 (2016) - 2012
- [j1]Bouazza Elbenani, Jacques A. Ferland, Jonathan Bellemare:
Genetic algorithm and large neighbourhood search to solve the cell formation problem. Expert Syst. Appl. 39(3): 2408-2414 (2012)
Conference and Workshop Papers
- 2017
- [c5]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
A novel reduction algorithm for the generalized traveling salesman problem. GECCO (Companion) 2017: 105-106 - 2016
- [c4]Manal Zettam, Bouazza Elbenani:
A novel randomized heuristic for the team orienteering problem. GOL 2016: 1-6 - [c3]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
An Empirical Study of the Multi-fragment Tour Construction Algorithm for the Travelling Salesman Problem. HIS 2016: 278-287 - [c2]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
Using Cluster Barycenters for the Generalized Traveling Salesman Problem. ISDA 2016: 135-143 - [c1]Bouchra Karoum, Bouazza Elbenani:
Clonal selection algorithm for the team orienteering problem. SITA 2016: 1-5
Parts in Books or Collections
- 2016
- [p1]Manal Zettam, Bouazza Elbenani:
Gravitational Search Algorithm Applied to the Cell Formation Problem. Nature-Inspired Computation in Engineering 2016: 251-266
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
