default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahdi Khemakhem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Ameni Kallel
, Molka Rekik, Mahdi Khemakhem:
DRL4HFC: Deep Reinforcement Learning for Container-Based Scheduling in Hybrid Fog/Cloud System. ICAART (2) 2024: 231-242- 2023
- [j16]Skander Htiouech, Khalil Chebil, Mahdi Khemakhem, Fidaa Abed, Monaji H. Alkiani:
An Extended Model for the UAVs-Assisted Multiperiodic Crowd Tracking Problem. Complex. 2023: 3001812:1-3001812:14 (2023) - [j15]Ameni Hbaieb, Mahdi Khemakhem:
Optimal network-aware virtual data center embedding. Int. J. Netw. Manag. 33(2) (2023) - 2022
- [j14]Ameni Kallel, Molka Rekik, Mahdi Khemakhem:
Hybrid-based framework for COVID-19 prediction via federated machine learning models. J. Supercomput. 78(5): 7078-7105 (2022) - 2021
- [j13]Ameni Hbaieb, Mahdi Khemakhem, Maher Ben Jemaa:
Virtual Machine Placement with Disk Anti-colocation Constraints Using Variable Neighborhood Search Heuristic. Inf. Syst. Frontiers 23(5): 1245-1271 (2021) - [j12]Ameni Kallel, Molka Rekik, Mahdi Khemakhem:
IoT-fog-cloud based architecture for smart systems: Prototypes of autism and COVID-19 monitoring systems. Softw. Pract. Exp. 51(1): 91-116 (2021)
2010 – 2019
- 2019
- [j11]Rahma Lahyani, Khalil Chebil, Mahdi Khemakhem, Leandro C. Coelho:
Matheuristics for solving the Multiple Knapsack Problem with Setup. Comput. Ind. Eng. 129: 76-89 (2019) - [j10]Ameni Hbaieb, Mahdi Khemakhem, Maher Ben Jemaa:
A survey and taxonomy on virtual data center embedding. J. Supercomput. 75(10): 6324-6360 (2019) - 2017
- [j9]Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet:
A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO J. Comput. Optim. 5(3): 393-422 (2017) - [c2]Ameni Hbaieb, Mahdi Khemakhem, Maher Ben Jemaa:
Using Decomposition and Local Search to Solve Large-Scale Virtual Machine Placement Problems with Disk Anti-Colocation Constraints. AICCSA 2017: 688-695 - 2016
- [j8]Mahdi Khemakhem, Khalil Chebil:
A tree search based combination heuristic for the knapsack problem with setup. Comput. Ind. Eng. 99: 280-286 (2016) - [j7]Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut:
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem. Eng. Appl. Artif. Intell. 55: 1-13 (2016) - [j6]Amine Lamine, Mahdi Khemakhem, Brahim Hnich, Habib Chabchoub:
Solving constrained optimization problems by solution-based decomposition search. J. Comb. Optim. 32(3): 672-695 (2016) - [j5]Boukthir Haddar, Mahdi Khemakhem, Hamza Rhimi, Habib Chabchoub:
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem. Nat. Comput. 15(1): 153-164 (2016) - 2015
- [j4]Khalil Chebil, Mahdi Khemakhem:
A dynamic programming algorithm for the Knapsack Problem with Setup. Comput. Oper. Res. 64: 40-50 (2015) - [j3]Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet:
Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241(1): 1-14 (2015) - [j2]Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut:
A hybrid heuristic for the 0-1 Knapsack Sharing Problem. Expert Syst. Appl. 42(10): 4653-4666 (2015) - [c1]Kaouther Samet, Samir Moalla, Mahdi Khemakhem:
New Approach to Partitioning Confidential Resources in Hybrid Clouds. CLOSER 2015: 506-513 - 2012
- [j1]Mahdi Khemakhem, Boukthir Haddar, Khalil Chebil, Saïd Hanafi:
A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem. Int. J. Appl. Metaheuristic Comput. 3(4): 43-63 (2012)
2000 – 2009
- 2008
- [b1]Mahdi Khemakhem:
Heuristiques pour un Problème de m-Tournées Sélectives. University of Valenciennes and Hainaut-Cambresis, France, 2008
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-10-07 22:06 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:
