Saïd Hanafi

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