#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Khalil Chebil, Mahdi Khemakhem
- Computers & OR
- 2015

The Knapsack Problem with Setup (KPS) is a generalization of the classical Knapsack problem (KP), where items are divided into families. An individual item can be selected only if a setup is incurred for the family to which it belongs. This paper provides a dynamic programming (DP) algorithm for the KPS that produces optimal solutions in pseudo-polynomial… (More)

- Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet
- European Journal of Operational Research
- 2015

- Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut
- Eng. Appl. of AI
- 2016

In this paper we propose a new hybrid heuristic approach that combines the Quantum Particle Swarm Optimization technique with a local search method to solve the Multidimensional Knapsack Problem. The approach also incorporates a heuristic repair operator that uses problem-specific knowledge instead of the penalty function technique commonly used for… (More)

Real-world optimization problems are very complex and NP-hard. The modeling of such problems is in constant evolution in term of constraints and objectives and their resolution is expensive in computation time. With all this change, even metaheuristics, well known for their efficiency, begin to be overtaken by data explosion. Recently, Thanks to the… (More)

- Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut
- Expert Syst. Appl.
- 2015

- Mahdi Khemakhem, Boukthir Haddar, Khalil Chebil, Saïd Hanafi
- Int. J. of Applied Metaheuristic Computing
- 2012

This paper proposes a new hybrid tree search algorithm to the Multidimensional Knapsack Problem (MKP) that effectively combines tabu search with a dynamic and adaptive neighborhood search procedure. The authors’ heuristic, based on a filter-and-fan (F&F) procedure, uses a Linear Programming-based Heuristic to generate a starting solution to the F&F process.… (More)

- Mahdi Khemakhem, Khalil Chebil
- Computers & Industrial Engineering
- 2016

- Amine Lamine, Mahdi Khemakhem, Brahim Hnich, Habib Chabchoub
- J. Comb. Optim.
- 2016

- Mahdi Khemakhem
- 2008

- Boukthir Haddar, Mahdi Khemakhem, Hamza Rhimi, Habib Chabchoub
- Natural Computing
- 2014

This study proposes a new hybrid heuristic approach that combines the quantum particle swarm optimization (QPSO) technique with a local search phase to solve the binary generalized knapsack sharing problem (GKSP). The approach also incorporates a heuristic repair operator that uses problem-specific knowledge instead of the penalty function technique… (More)