Mahdi Khemakhem

Orcid: 0000-0001-5603-1947

According to our database1, Mahdi Khemakhem authored at least 20 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
DRL4HFC: Deep Reinforcement Learning for Container-Based Scheduling in Hybrid Fog/Cloud System.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
Optimal network-aware virtual data center embedding.
Int. J. Netw. Manag., 2023

An Extended Model for the UAVs-Assisted Multiperiodic Crowd Tracking Problem.
Complex., 2023

2022
Hybrid-based framework for COVID-19 prediction via federated machine learning models.
J. Supercomput., 2022

2021
IoT-fog-cloud based architecture for smart systems: Prototypes of autism and COVID-19 monitoring systems.
Softw. Pract. Exp., 2021

Virtual Machine Placement with Disk Anti-colocation Constraints Using Variable Neighborhood Search Heuristic.
Inf. Syst. Frontiers, 2021

2019
A survey and taxonomy on virtual data center embedding.
J. Supercomput., 2019

Matheuristics for solving the Multiple Knapsack Problem with Setup.
Comput. Ind. Eng., 2019

2017
A unified matheuristic for solving multi-constrained traveling salesman problems with profits.
EURO J. Comput. Optim., 2017

Using Decomposition and Local Search to Solve Large-Scale Virtual Machine Placement Problems with Disk Anti-Colocation Constraints.
Proceedings of the 14th IEEE/ACS International Conference on Computer Systems and Applications, 2017

2016
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem.
Nat. Comput., 2016

Solving constrained optimization problems by solution-based decomposition search.
J. Comb. Optim., 2016

A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.
Eng. Appl. Artif. Intell., 2016

A tree search based combination heuristic for the knapsack problem with setup.
Comput. Ind. Eng., 2016

2015
A hybrid heuristic for the 0-1 Knapsack Sharing Problem.
Expert Syst. Appl., 2015

Rich vehicle routing problems: From a taxonomy to a definition.
Eur. J. Oper. Res., 2015

A dynamic programming algorithm for the Knapsack Problem with Setup.
Comput. Oper. Res., 2015

New Approach to Partitioning Confidential Resources in Hybrid Clouds.
Proceedings of the CLOSER 2015, 2015

2012
A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem.
Int. J. Appl. Metaheuristic Comput., 2012

2008
Heuristiques pour un Problème de m-Tournées Sélectives.
PhD thesis, 2008


  Loading...