default search action
Noureddine Bouhmala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c16]Thomas Nordli, Noureddine Bouhmala:
A Look-Ahead Based Meta-heuristics for Optimizing Continuous Optimization Problems. OL2A 2021: 48-55
2010 – 2019
- 2019
- [j14]Noureddine Bouhmala:
A Kernighan-Lin inspired algorithm for MAX-SAT. Sci. China Inf. Sci. 62(11): 219106:1-219106:3 (2019) - [j13]Noureddine Bouhmala:
Combining simulated annealing with local search heuristic for MAX-SAT. J. Heuristics 25(1): 47-69 (2019) - 2016
- [j12]Noureddine Bouhmala:
A multilevel genetic algorithm for the clustering problem. Int. J. Inf. Commun. Technol. 9(1): 101-116 (2016) - [j11]Noureddine Bouhmala:
A variable neighbourhood search structure based-genetic algorithm for combinatorial optimisation problems. Int. J. Intell. Syst. Technol. Appl. 15(2): 127-146 (2016) - [c15]Noureddine Bouhmala, Mikkel Syse Groesland, Vetle Volden-Freberg:
Enhanced Metaheuristics with the Multilevel Paradigm for MAX-CSPs. ICCSA (4) 2016: 543-553 - [c14]Noureddine Bouhmala:
How Good is the Euclidean Distance Metric for the Clustering Problem. IIAI-AAI 2016: 312-315 - [c13]Noureddine Bouhmala, Mats Oselan, Øyestein Brådland:
Enhanced WalkSAT with Variable Neighborhood Search for MAX-SAT Problems. IntelliSys (1) 2016: 368-376 - [c12]Noureddine Bouhmala:
Combining Genetic Algorithm with the Multilevel Paradigm for the Maximum Constraint Satisfaction Problem. MOD 2016: 330-340 - 2015
- [j10]Noureddine Bouhmala, Karina Hjelmervik
, Kjell Ivar Øvergård:
A Generalized Variable Neighborhood Search For Combinatorial Optimization Problems. Electron. Notes Discret. Math. 47: 45-52 (2015) - [j9]Noureddine Bouhmala:
A multilevel learning automata for MAX-SAT. Int. J. Mach. Learn. Cybern. 6(6): 911-921 (2015) - [c11]Thomas Andre Lian, Marilex Rea Llave, Morten Goodwin, Noureddine Bouhmala:
Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem. IEA/AIE 2015: 222-231 - 2014
- [j8]Noureddine Bouhmala:
Enhanced Walk-SAT with Finite Learning Automata For MAX-SAT. Int. J. Comb. Optim. Probl. Informatics 5(3): 20-36 (2014) - [j7]Jaziar Radianti
Comparing Different Crowd Emergency Evacuation Models Based on Human Centered Sensing Criteria. Int. J. Inf. Syst. Crisis Response Manag. 6(3): 53-70 (2014) - 2013
- [c10]Noureddine Bouhmala, Karina Hjelmervik
Combining An Evolutionary Algorithm With The Multilevel Paradigm For The Simulation Of Complex System. ECMS 2013: 753-757 - [c9]Jaziar Radianti
Crowd Models for Emergency Evacuation: A Review Targeting Human-Centered Sensing. HICSS 2013: 156-165 - 2012
- [j6]Noureddine Bouhmala:
A Multilevel Memetic Algorithm for Large SAT-Encoded Problems. Evol. Comput. 20(4): 641-664 (2012) - [c8]Noureddine Bouhmala:
Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study. IJCCI 2012: 294-296 - 2010
- [j5]Noureddine Bouhmala, Ole-Christoffer Granmo
Combining finite learning automata with GSAT for the satisfiability problem. Eng. Appl. Artif. Intell. 23(5): 715-726 (2010) - [j4]Noureddine Bouhmala, Ole-Christoffer Granmo:
Stochastic Learning for SAT- Encoded Graph Coloring Problems. Int. J. Appl. Metaheuristic Comput. 1(3): 1-19 (2010) - [c7]Ole-Christoffer Granmo, Noureddine Bouhmala:
Enhancing Local-search based SAT Solvers with Learning Capability. ICAART (1) 2010: 515-521
2000 – 2009
- 2008
- [c6]Noureddine Bouhmala, Ole-Christoffer Granmo
Solving Graph Coloring Problems Using Learning Automata. EvoCOP 2008: 277-288 - 2007
- [j3]Ole-Christoffer Granmo, Noureddine Bouhmala:
Solving the Satisfiability Problem Using Finite Learning Automata. Int. J. Comput. Sci. Appl. 4(3): 15-29 (2007) - 2004
- [c5]Noureddine Bouhmala:
Combining Local Search with the Multilevel Paradigm for the Traveling Salesman Problem. Hybrid Metaheuristics 2004: 51-58 - 2003
- [j2]Pedro Meseguer, Noureddine Bouhmala, Taoufik Bouzoubaa, Morten Irgens, Martí Sánchez-Fibla:
Current Approaches for Solving Over-Constrained Problems. Constraints An Int. J. 8(1): 9-39 (2003) - [j1]Noureddine Bouhmala:
A Multilevel Genetic Algorithm for the Traveling Salesman Problem. Electron. Notes Discret. Math. 15: 54 (2003) - [c4]Noureddine Bouhmala:
Multilevel Techniques for the Traveling Salesman Problem. IICAI 2003: 928-937 - 2000
- [c3]Noureddine Bouhmala, Xing Cai:
Partition of Unstructured Finite Element Meshes by a Multilevel Approach. PARA 2000: 187-195
1990 – 1999
- 1996
- [c2]Noureddine Bouhmala, P. A. Knutti, Hans-Heinrich Naegeli:
A distributable algorithm for optimizing mesh partitions. ICPADS 1996: 544-549 - 1995
- [c1]Noureddine Bouhmala, Khaled Ghédira, Hans-Heinrich Naegeli:
How to Partition a Graph by a Multi-Agent Approach based on a Hybrid Optimization Tool. SCAI 1995: 353-357
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-05-08 21:47 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: