Saïd Hanafi

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 40

Top Topics

Scheduling Problem

Traveling Salesman

Variable Neighborhood Search

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Song Wu, Wei Yang, Saïd Hanafi, Christophe Wilbaut, Yang Wang
Iterated local search with ejection chains for the space-free multi-row facility layout problem. Eur. J. Oper. Res. 316 (3) (2024)
Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena
Extended formulations for perfect domination problems and their algorithmic implications. Eur. J. Oper. Res. 310 (2) (2023)
Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. Eur. J. Oper. Res. 304 (3) (2023)
Rachid Benmansour, Raca Todosijevic, Saïd Hanafi
Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optim. Lett. 17 (9) (2023)
Saïd Hanafi, Yang Wang, Fred W. Glover, Wei Yang, Rick Hennig
Tabu search exploiting local optimality in binary optimization. Eur. J. Oper. Res. 308 (3) (2023)
Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi
An efficient scenario penalization matheuristic for a stochastic scheduling problem. J. Heuristics 29 (2) (2023)
Raca Todosijevic, Saïd Hanafi, Fred W. Glover
On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs. Discret. Appl. Math. 308 (2022)
Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville
Variable neighborhood search for the discounted {0-1} knapsack problem. Appl. Soft Comput. 131 (2022)
Fred W. Glover, Saïd Hanafi, Gintaras Palubeckis
Bi-objective Optimization of Biclustering with Binary Data. CoRR (2020)
Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover
Bi-objective optimization of biclustering with binary data. Inf. Sci. 538 (2020)
Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. Comput. Optim. Appl. 75 (1) (2020)
Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui, Saïd Hanafi
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. Int. Trans. Oper. Res. 27 (1) (2020)
Saïd Hanafi, Renata Mansini, Roberto Zanotti
The multi-visit team orienteering problem with precedence constraints. Eur. J. Oper. Res. 282 (2) (2020)
Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic
The selective traveling salesman problem with draft limits. J. Heuristics 26 (3) (2020)
Issam Krimi, Rachid Benmansour, Saïd Hanafi, Nizar Elhachemi
Two-machine flow shop with synchronized periodic maintenance. RAIRO Oper. Res. 53 (1) (2019)
Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut
A special case of Variable-Sized Bin Packing Problem with Color Constraints. CoDIT (2019)
Rachid Benmansour, Oliver Braun, Saïd Hanafi
The single-processor scheduling problem with time restrictions: complexity and related problems. J. Sched. 22 (4) (2019)
Oualid Guemri, Placide Nduwayo, Raca Todosijevic, Saïd Hanafi, Fred W. Glover
Probabilistic Tabu Search for the Cross-Docking Assignment Problem. Eur. J. Oper. Res. 277 (3) (2019)
Diego Arenas, Paola Pellegrini, Saïd Hanafi, Joaquin Rodriguez
Timetable rearrangement to cope with railway maintenance activities. Comput. Oper. Res. 95 (2018)
Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic
Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. ICVNS (2018)
Bernard Gendron, Saïd Hanafi, Raca Todosijevic
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268 (1) (2018)
Safa Khalouli, Rachid Benmansour, Saïd Hanafi
Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities. Int. J. Intell. Eng. Informatics 6 (1/2) (2018)
Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic, Saïd Hanafi
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11 (6) (2017)
Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78 (2017)
Mariem Ben Salem, Saïd Hanafi, Raouia Taktak, Hanêne Ben-Abdallah
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem. RAIRO Oper. Res. 51 (3) (2017)
Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Saïd Hanafi
New complexity results on scheduling problem in a robotic cell. RAIRO Oper. Res. 51 (3) (2017)
Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5 (3) (2017)
Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron
A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11 (6) (2017)
Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24 (3) (2017)
Danijela Doric, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba
Clustering approach in maintenance of capillary railway network. Electron. Notes Discret. Math. 58 (2017)
Abdessamad Ait El Cadi, Rabie Ben Atitallah, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba
New MIP model for multiprocessor scheduling problem with communication delays. Optim. Lett. 11 (6) (2017)
Saïd Hanafi, Raca Todosijevic
Mathematical programming based heuristics for the 0-1 MIP: a survey. J. Heuristics 23 (4) (2017)
François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258 (2) (2017)
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 (2016)
Igor Vasilyev, Maurizio Boccia, Saïd Hanafi
An implementation of exact knapsack separation. J. Glob. Optim. 66 (1) (2016)
Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba
Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252 (2) (2016)
Safa Khalouli, Rachid Benmansour, Saïd Hanafi
An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance. CoDIT (2016)
Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61 (2015)
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut
A hybrid heuristic for the 0-1 Knapsack Sharing Problem. Expert Syst. Appl. 42 (10) (2015)
Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi
A two-stage flow shop scheduling problem with transportation considerations. 4OR 13 (4) (2015)
Nacira Chikhi, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi, Moncef Abbas
A case study of a two-stage flow shop with dedicated machines and a single robot. CoDIT (2014)
Diego Arenas, Remy Chevirer, Saïd Hanafi, Joaquin Rodriguez
Solving the Periodic Timetabling Problem using a Genetic Algorithm. CoRR (2014)
Mariem Baazaoui, Saïd Hanafi, Hichem Kamoun
A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case. CoDIT (2014)
Rachid Benmansour, Hamid Allaoui, Abdelhakim Artiba, Saïd Hanafi
Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput. Oper. Res. 47 (2014)
Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic
A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52 (2014)
Karim M. A. Ali, Rabie Ben Atitallah, Saïd Hanafi, Jean-Luc Dekeyser
A generic pixel distribution architecture for parallel video processing. ReConFig (2014)
Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg
Editorial. Comput. Oper. Res. 52 (2014)
Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. J. Heuristics 19 (4) (2013)
Luce Brotcorne, Saïd Hanafi, Raïd Mansi
One-level reformulation of the bilevel Knapsack problem using dynamic programming. Discret. Optim. 10 (1) (2013)
Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi
Variable neighborhood search for the travelling deliveryman problem. 4OR 11 (1) (2013)
Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut
Three-stage hybrid-flowshop model for cross-docking. Comput. Oper. Res. 40 (4) (2013)
Samira Almoustafa, Saïd Hanafi, Nenad Mladenovic
New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226 (3) (2013)
Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic
Variable neighborhood search for location routing. Comput. Oper. Res. 40 (1) (2013)
Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi
A variable neighborhood search for the multi-product inventory routing problem. Electron. Notes Discret. Math. 39 (2012)
Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220 (1) (2012)
Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. ICORES (2012)
Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Comput. Oper. Res. 39 (1) (2012)
Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi
The min-conflict packing problem. Comput. Oper. Res. 39 (9) (2012)
Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville
Hybrid approaches for the two-scenario max-min knapsack problem. Int. Trans. Oper. Res. 19 (3) (2012)
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) (2012)
Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub
Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. 39 (3) (2012)
Raca Todosijevic, Marko Mladenovic, Saïd Hanafi, Igor Crévits
VNS based heuristic for solving the Unit Commitment problem. Electron. Notes Discret. Math. 39 (2012)
Saïd Hanafi, Nicola Yanev
Tabu search approaches for solving the two-group classification problem. Ann. Oper. Res. 183 (1) (2011)
Saïd Hanafi, Christophe Wilbaut
Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Ann. Oper. Res. 183 (1) (2011)
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214 (3) (2011)
Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. Stud. Inform. Univ. 9 (3) (2011)
Ahmed Riadh Rebai, Saïd Hanafi
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs CoRR (2011)
Ahmed Riadh Rebai, Saïd Hanafi
An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs CoRR (2011)
Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. Discret. Appl. Math. 158 (2) (2010)
Ahmed Riadh Rebai, M. Fliss Rebai, Hussein M. Alnuweiri, Saïd Hanafi
An enhanced heuristic technique for AP selection in 802.11 handoff procedure. ICT (2010)
Fred W. Glover, Saïd Hanafi
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance. Int. J. Appl. Metaheuristic Comput. 1 (2) (2010)
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic
Variable neighbourhood decomposition search for 0-1 mixed integer programs. Comput. Oper. Res. 37 (6) (2010)
Youssef Masmoudi, Habib Chabchoub, Saïd Hanafi, Ahmed Riadh Rebai
A Mathematical Programming Based Procedure for Breast Cancer Classification. J. Math. Model. Algorithms 9 (3) (2010)
Fred W. Glover, Saïd Hanafi
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity. Int. J. Appl. Metaheuristic Comput. 1 (1) (2010)
Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. Electron. Notes Discret. Math. 36 (2010)
Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev
A tabu search with an oscillation strategy for the discriminant analysis problem. Comput. Oper. Res. 37 (10) (2010)
Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. SEA (2010)
Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub
An Iterated Local Search for Solving A Location-Routing Problem. Electron. Notes Discret. Math. 36 (2010)
Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem. Hybrid Metaheuristics (2010)
Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electron. Notes Discret. Math. 36 (2010)
Christophe Wilbaut, Saïd Hanafi
New convergent heuristics for 0-1 mixed integer programming. Eur. J. Oper. Res. 195 (1) (2009)
Luce Brotcorne, Saïd Hanafi, Raïd Mansi
A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37 (3) (2009)
Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. Hybrid Metaheuristics (2009)
Luce Brotcorne, Clarisse Dhaenens, Saïd Hanafi, El-Ghazali Talbi
Articles ROADEF 2006. RAIRO Oper. Res. 43 (3) (2009)
Christophe Wilbaut, Saïd Salhi, Saïd Hanafi
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 199 (2) (2009)
Ahmed Riadh Rebai, Hussein M. Alnuweiri, Saïd Hanafi
A novel prevent-scan Handoff technique for IEEE 802.11 WLANs. ICUMT (2009)
Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search CoRR (2009)
Ahmed Riadh Rebai, Mariem Fliss, Slah Jarboui, Saïd Hanafi
A New Link Adaptation Scheme for IEEE 802.11 WLANs. NTMS (2008)
Saïd Hanafi, Christophe Wilbaut
Scatter Search for the 0-1 Multidimensional Knapsack Problem. J. Math. Model. Algorithms 7 (2) (2008)
Saïd Hanafi, Fred W. Glover
Exploiting nested inequalities and surrogate constraints. Eur. J. Oper. Res. 179 (1) (2007)
Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim
Mathematical programming approach to the Petri nets reachability problem. Eur. J. Oper. Res. 177 (1) (2007)
Arnaud Fréville, Saïd Hanafi
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects. Ann. Oper. Res. 139 (1) (2005)
Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi
Efficient reachability analysis of bounded Petri nets using constraint programming. SMC (2) (2004)
Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. CPAIOR (2004)
Saïd Hanafi, Fred W. Glover
Resolution Search and Dynamic Branch-and-Bound. J. Comb. Optim. 6 (4) (2002)
Fred W. Glover, Saïd Hanafi
Tabu search and finite convergence. Discret. Appl. Math. 119 (1-2) (2002)
Saïd Hanafi, Arnaud Fréville
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List. RAIRO Oper. Res. 35 (2) (2001)
Saïd Hanafi
On the Convergence of Tabu Search. J. Heuristics 7 (1) (2001)
Saïd Hanafi, Arnaud Fréville
An efficient tabu search approach for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 106 (2-3) (1998)