Saïd Hanafi

According to our database1, Saïd Hanafi authored at least 90 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem.
Int. Trans. Oper. Res., 2020

Bi-objective optimization of biclustering with binary data.
Inf. Sci., 2020

The selective traveling salesman problem with draft limits.
J. Heuristics, 2020

The multi-visit team orienteering problem with precedence constraints.
Eur. J. Oper. Res., 2020

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance.
Comput. Optim. Appl., 2020

2019
The single-processor scheduling problem with time restrictions: complexity and related problems.
J. Sched., 2019

Two-machine flow shop with synchronized periodic maintenance.
RAIRO Oper. Res., 2019

Probabilistic Tabu Search for the Cross-Docking Assignment Problem.
Eur. J. Oper. Res., 2019

A special case of Variable-Sized Bin Packing Problem with Color Constraints.
Proceedings of the 6th International Conference on Control, 2019

2018
Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities.
Int. J. Intell. Eng. Informatics, 2018

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
Eur. J. Oper. Res., 2018

Timetable rearrangement to cope with railway maintenance activities.
Comput. Oper. Res., 2018

Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem.
RAIRO Oper. Res., 2017

New complexity results on scheduling problem in a robotic cell.
RAIRO Oper. Res., 2017

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

A general variable neighborhood search variants for the travelling salesman problem with draft limits.
Optim. Lett., 2017

New MIP model for multiprocessor scheduling problem with communication delays.
Optim. Lett., 2017

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem.
Int. Trans. Oper. Res., 2017

Mathematical programming based heuristics for the 0-1 MIP: a survey.
J. Heuristics, 2017

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
Eur. J. Oper. Res., 2017

Clustering approach in maintenance of capillary railway network.
Electron. Notes Discret. Math., 2017

Variable neighborhood search: basics and variants.
EURO J. Comput. Optim., 2017

A general variable neighborhood search for the swap-body vehicle routing problem.
Comput. Oper. Res., 2017

2016
An implementation of exact knapsack separation.
J. Glob. Optim., 2016

Nested general variable neighborhood search for the periodic maintenance problem.
Eur. J. Oper. Res., 2016

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

An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance.
Proceedings of the International Conference on Control, 2016

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

Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res., 2015

A two-stage flow shop scheduling problem with transportation considerations.
4OR, 2015

2014
Solving the Periodic Timetabling Problem using a Genetic Algorithm.
CoRR, 2014

Editorial.
Comput. Oper. Res., 2014

A two phase variable neighborhood search for the multi-product inventory routing problem.
Comput. Oper. Res., 2014

Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance.
Comput. Oper. Res., 2014

A generic pixel distribution architecture for parallel video processing.
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.
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.
Proceedings of the International Conference on Control, 2014

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

New exact method for large asymmetric distance-constrained vehicle routing problem.
Eur. J. Oper. Res., 2013

One-level reformulation of the bilevel Knapsack problem using dynamic programming.
Discret. Optim., 2013

Variable neighborhood search for location routing.
Comput. Oper. Res., 2013

Three-stage hybrid-flowshop model for cross-docking.
Comput. Oper. Res., 2013

Variable neighborhood search for the travelling deliveryman problem.
4OR, 2013

2012
Hybrid approaches for the two-scenario max-min knapsack problem.
Int. Trans. Oper. Res., 2012

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

Genetic algorithm with iterated local search for solving a location-routing problem.
Expert Syst. Appl., 2012

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem.
Eur. J. Oper. Res., 2012

VNS based heuristic for solving the Unit Commitment problem.
Electron. Notes Discret. Math., 2012

A variable neighborhood search for the multi-product inventory routing problem.
Electron. Notes Discret. Math., 2012

The min-conflict packing problem.
Comput. Oper. Res., 2012

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.
Comput. Oper. Res., 2012

Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
Proceedings of the ICORES 2012, 2012

2011
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem.
Stud. Inform. Univ., 2011

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res., 2011

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

An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs
CoRR, 2011

Tabu search approaches for solving the two-group classification problem.
Ann. Oper. Res., 2011

Improved convergent heuristics for the 0-1 multidimensional knapsack problem.
Ann. Oper. Res., 2011

2010
A Mathematical Programming Based Procedure for Breast Cancer Classification.
J. Math. Model. Algorithms, 2010

Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance.
Int. J. Appl. Metaheuristic Comput., 2010

Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity.
Int. J. Appl. Metaheuristic Comput., 2010

Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem.
Electron. Notes Discret. Math., 2010

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility.
Electron. Notes Discret. Math., 2010

An Iterated Local Search for Solving A Location-Routing Problem.
Electron. Notes Discret. Math., 2010

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.
Discret. Appl. Math., 2010

Variable neighbourhood decomposition search for 0-1 mixed integer programs.
Comput. Oper. Res., 2010

A tabu search with an oscillation strategy for the discriminant analysis problem.
Comput. Oper. Res., 2010

New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

An enhanced heuristic technique for AP selection in 802.11 handoff procedure.
Proceedings of the 17th International Conference on Telecommunications, 2010

New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009
Articles ROADEF 2006.
RAIRO Oper. Res., 2009

A dynamic programming algorithm for the bilevel knapsack problem.
Oper. Res. Lett., 2009

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2009

New convergent heuristics for 0-1 mixed integer programming.
Eur. J. Oper. Res., 2009

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
CoRR, 2009

A novel prevent-scan Handoff technique for IEEE 802.11 WLANs.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008
Scatter Search for the 0-1 Multidimensional Knapsack Problem.
J. Math. Model. Algorithms, 2008

A New Link Adaptation Scheme for IEEE 802.11 WLANs.
Proceedings of the NTMS 2008, 2008

2007
Exploiting nested inequalities and surrogate constraints.
Eur. J. Oper. Res., 2007

Mathematical programming approach to the Petri nets reachability problem.
Eur. J. Oper. Res., 2007

2005
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects.
Ann. Oper. Res., 2005

2004
Efficient reachability analysis of bounded Petri nets using constraint programming.
Proceedings of the IEEE International Conference on Systems, 2004

Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming.
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.
J. Comb. Optim., 2002

Tabu search and finite convergence.
Discret. Appl. Math., 2002

2001
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List.
RAIRO Oper. Res., 2001

On the Convergence of Tabu Search.
J. Heuristics, 2001

1998
An efficient tabu search approach for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 1998


  Loading...