Saïd Hanafi

According to our database, Saïd Hanafi authored at least 97 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Variable neighborhood search for the single machine scheduling problem to minimize the total early work.

Rachid Benmansour, Raca Todosijevic, Saïd Hanafi

Optim. Lett., December, 2023

Extended formulations for perfect domination problems and their algorithmic implications.

Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena

Eur. J. Oper. Res., October, 2023

Tabu search exploiting local optimality in binary optimization.

Saïd Hanafi, Yang Wang, Fred W. Glover, Wei Yang, Rick Hennig

Eur. J. Oper. Res., August, 2023

An efficient scenario penalization matheuristic for a stochastic scheduling problem.

Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi

J. Heuristics, 2023

Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem.

Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville

Eur. J. Oper. Res., 2023

2022

On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs.

Raca Todosijevic, Saïd Hanafi, Fred W. Glover

Discret. Appl. Math., 2022

Variable neighborhood search for the discounted {0-1} knapsack problem.

Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville

Appl. Soft Comput., 2022

2020

Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem.

Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui, Saïd Hanafi

Int. Trans. Oper. Res., 2020

Bi-objective optimization of biclustering with binary data.

Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover

Inf. Sci., 2020

The selective traveling salesman problem with draft limits.

Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic

J. Heuristics, 2020

The multi-visit team orienteering problem with precedence constraints.

Saïd Hanafi, Renata Mansini, Roberto Zanotti

Eur. J. Oper. Res., 2020

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance.

Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi

Comput. Optim. Appl., 2020

2019

The single-processor scheduling problem with time restrictions: complexity and related problems.

Rachid Benmansour, Oliver Braun, Saïd Hanafi

J. Sched., 2019

Two-machine flow shop with synchronized periodic maintenance.

Issam Krimi, Rachid Benmansour, Saïd Hanafi, Nizar El Hachemi

RAIRO Oper. Res., 2019

Probabilistic Tabu Search for the Cross-Docking Assignment Problem.

Oualid Guemri, Placide Nduwayo, Raca Todosijevic, Saïd Hanafi, Fred W. Glover

Eur. J. Oper. Res., 2019

A special case of Variable-Sized Bin Packing Problem with Color Constraints.

Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut

Proceedings of the 6th International Conference on Control, 2019

2018

Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities.

Safa Khalouli, Rachid Benmansour, Saïd Hanafi

Int. J. Intell. Eng. Informatics, 2018

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.

Bernard Gendron, Saïd Hanafi, Raca Todosijevic

Eur. J. Oper. Res., 2018

Timetable rearrangement to cope with railway maintenance activities.

Diego Arenas, Paola Pellegrini, Saïd Hanafi, Joaquin Rodriguez

Comput. Oper. Res., 2018

Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions.

Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic

Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017

Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem.

Mariem Ben Salem, Saïd Hanafi, Raouia Taktak, Hanêne Ben-Abdallah

RAIRO Oper. Res., 2017

New complexity results on scheduling problem in a robotic cell.

Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Saïd Hanafi

RAIRO Oper. Res., 2017

A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem.

Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic, Saïd Hanafi

Optim. Lett., 2017

A general variable neighborhood search variants for the travelling salesman problem with draft limits.

Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron

Optim. Lett., 2017

New MIP model for multiprocessor scheduling problem with communication delays.

Abdessamad Ait El Cadi, Rabie Ben Atitallah, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba

Optim. Lett., 2017

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.

Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic

Int. Trans. Oper. Res., 2017

Mathematical programming based heuristics for the 0-1 MIP: a survey.

Saïd Hanafi, Raca Todosijevic

J. Heuristics, 2017

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.

François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves

Eur. J. Oper. Res., 2017

Clustering approach in maintenance of capillary railway network.

Danijela Doric, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba

Electron. Notes Discret. Math., 2017

Variable neighborhood search: basics and variants.

Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi

EURO J. Comput. Optim., 2017

A general variable neighborhood search for the swap-body vehicle routing problem.

Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron

Comput. Oper. Res., 2017

2016

An implementation of exact knapsack separation.

Igor Vasilyev, Maurizio Boccia, Saïd Hanafi

J. Glob. Optim., 2016

Nested general variable neighborhood search for the periodic maintenance problem.

Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba

Eur. J. Oper. Res., 2016

A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem.

Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut

Eng. Appl. Artif. Intell., 2016

An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance.

Safa Khalouli, Rachid Benmansour, Saïd Hanafi

Proceedings of the International Conference on Control, 2016

2015

A hybrid heuristic for the 0-1 Knapsack Sharing Problem.

Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut

Expert Syst. Appl., 2015

Skewed general variable neighborhood search for the location routing scheduling problem.

Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho

Comput. Oper. Res., 2015

A two-stage flow shop scheduling problem with transportation considerations.

Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi

4OR, 2015

2014

Solving the Periodic Timetabling Problem using a Genetic Algorithm.

Diego Arenas, Remy Chevirer, Saïd Hanafi, Joaquin Rodriguez

CoRR, 2014

Editorial.

Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg

Comput. Oper. Res., 2014

A two phase variable neighborhood search for the multi-product inventory routing problem.

Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic

Comput. Oper. Res., 2014

Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance.

Rachid Benmansour, Hamid Allaoui, Abdelhakim Artiba, Saïd Hanafi

Comput. Oper. Res., 2014

A generic pixel distribution architecture for parallel video processing.

Karim M. A. Ali, Rabie Ben Atitallah, Saïd Hanafi, Jean-Luc Dekeyser

Proceedings of the 2014 International Conference on ReConFigurable Computing and FPGAs, 2014

A case study of a two-stage flow shop with dedicated machines and a single robot.

Nacira Chikhi, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi, Moncef Abbas

Proceedings of the International Conference on Control, 2014

A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case.

Mariem Baazaoui, Saïd Hanafi, Hichem Kamoun

Proceedings of the International Conference on Control, 2014

2013

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems.

Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez

J. Heuristics, 2013

New exact method for large asymmetric distance-constrained vehicle routing problem.

Samira Almoustafa, Saïd Hanafi, Nenad Mladenovic

Eur. J. Oper. Res., 2013

One-level reformulation of the bilevel Knapsack problem using dynamic programming.

Luce Brotcorne, Saïd Hanafi, Raïd Mansi

Discret. Optim., 2013

Variable neighborhood search for location routing.

Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic

Comput. Oper. Res., 2013

Three-stage hybrid-flowshop model for cross-docking.

Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut

Comput. Oper. Res., 2013

Variable neighborhood search for the travelling deliveryman problem.

Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi

4OR, 2013

2012

Hybrid approaches for the two-scenario max-min knapsack problem.

Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville

Int. Trans. Oper. Res., 2012

A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem.

Mahdi Khemakhem, Boukthir Haddar, Khalil Chebil, Saïd Hanafi

Int. J. Appl. Metaheuristic Comput., 2012

Genetic algorithm with iterated local search for solving a location-routing problem.

Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub

Expert Syst. Appl., 2012

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem.

Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic

Eur. J. Oper. Res., 2012

VNS based heuristic for solving the Unit Commitment problem.

Raca Todosijevic, Marko Mladenovic, Saïd Hanafi, Igor Crévits

Electron. Notes Discret. Math., 2012

A variable neighborhood search for the multi-product inventory routing problem.

Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi

Electron. Notes Discret. Math., 2012

The min-conflict packing problem.

Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi

Comput. Oper. Res., 2012

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.

Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut

Comput. Oper. Res., 2012

Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.

Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho

Proceedings of the ICORES 2012, 2012

2011

A parallel subgradient algorithm for Lagrangean dual function of the p-median problem.

Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev

Stud. Inform. Univ., 2011

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.

Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi

Eur. J. Oper. Res., 2011

A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs

Ahmed Riadh Rebai, Saïd Hanafi

CoRR, 2011

An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs

Ahmed Riadh Rebai, Saïd Hanafi

CoRR, 2011

Tabu search approaches for solving the two-group classification problem.

Saïd Hanafi, Nicola Yanev

Ann. Oper. Res., 2011

Improved convergent heuristics for the 0-1 multidimensional knapsack problem.

Saïd Hanafi, Christophe Wilbaut

Ann. Oper. Res., 2011

2010

A Mathematical Programming Based Procedure for Breast Cancer Classification.

Youssef Masmoudi, Habib Chabchoub, Saïd Hanafi, Ahmed Riadh Rebai

J. Math. Model. Algorithms, 2010

Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance.

Fred W. Glover, Saïd Hanafi

Int. J. Appl. Metaheuristic Comput., 2010

Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity.

Fred W. Glover, Saïd Hanafi

Int. J. Appl. Metaheuristic Comput., 2010

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.

Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits

Electron. Notes Discret. Math., 2010

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility.

Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic

Electron. Notes Discret. Math., 2010

An Iterated Local Search for Solving A Location-Routing Problem.

Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub

Electron. Notes Discret. Math., 2010

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.

Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon

Discret. Appl. Math., 2010

Variable neighbourhood decomposition search for 0-1 mixed integer programs.

Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic

Comput. Oper. Res., 2010

A tabu search with an oscillation strategy for the discriminant analysis problem.

Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev

Comput. Oper. Res., 2010

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.

Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

An enhanced heuristic technique for AP selection in 802.11 handoff procedure.

Ahmed Riadh Rebai, M. Fliss Rebai, Hussein M. Alnuweiri, Saïd Hanafi

Proceedings of the 17th International Conference on Telecommunications, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.

Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits

Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009

Articles ROADEF 2006.

Luce Brotcorne, Clarisse Dhaenens, Saïd Hanafi, El-Ghazali Talbi

RAIRO Oper. Res., 2009

A dynamic programming algorithm for the bilevel knapsack problem.

Luce Brotcorne, Saïd Hanafi, Raïd Mansi

Oper. Res. Lett., 2009

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.

Christophe Wilbaut, Saïd Salhi, Saïd Hanafi

Eur. J. Oper. Res., 2009

New convergent heuristics for 0-1 mixed integer programming.

Christophe Wilbaut, Saïd Hanafi

Eur. J. Oper. Res., 2009

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon

CoRR, 2009

A novel prevent-scan Handoff technique for IEEE 802.11 WLANs.

Ahmed Riadh Rebai, Hussein M. Alnuweiri, Saïd Hanafi

Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.

Saïd Hanafi, Raïd Mansi, Christophe Wilbaut

Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008

Scatter Search for the 0-1 Multidimensional Knapsack Problem.

Saïd Hanafi, Christophe Wilbaut

J. Math. Model. Algorithms, 2008

A New Link Adaptation Scheme for IEEE 802.11 WLANs.

Ahmed Riadh Rebai, Mariem Fliss, Slah Jarboui, Saïd Hanafi

Proceedings of the NTMS 2008, 2008

2007

Exploiting nested inequalities and surrogate constraints.

Saïd Hanafi, Fred W. Glover

Eur. J. Oper. Res., 2007

Mathematical programming approach to the Petri nets reachability problem.

Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim

Eur. J. Oper. Res., 2007

2005

The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects.

Arnaud Fréville, Saïd Hanafi

Ann. Oper. Res., 2005

2004

Efficient reachability analysis of bounded Petri nets using constraint programming.

Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi

Proceedings of the IEEE International Conference on Systems, 2004

Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming.

Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2002

Resolution Search and Dynamic Branch-and-Bound.

Saïd Hanafi, Fred W. Glover

J. Comb. Optim., 2002

Tabu search and finite convergence.

Fred W. Glover, Saïd Hanafi

Discret. Appl. Math., 2002

2001

Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List.

Saïd Hanafi, Arnaud Fréville

RAIRO Oper. Res., 2001

On the Convergence of Tabu Search.

Saïd Hanafi

J. Heuristics, 2001

1998

An efficient tabu search approach for the 0-1 multidimensional knapsack problem.

Saïd Hanafi, Arnaud Fréville

Eur. J. Oper. Res., 1998