![]() | ![]() |
| 2012 | ||
|---|---|---|
| 39 | 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: 305-312 | |
| 38 | Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut: Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Computers & OR 39(1): 32-41 (2012) | |
| 37 | Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi: The min-conflict packing problem. Computers & OR 39(9): 2122-2132 (2012) | |
| 36 | Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research 220(1): 270-285 (2012) | |
| 35 | 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): 2865-2871 (2012) | |
| 2011 | ||
| 34 | Saïd Hanafi, Christophe Wilbaut: Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Annals OR 183(1): 125-142 (2011) | |
| 33 | Saïd Hanafi, Nicola Yanev: Tabu search approaches for solving the two-group classification problem. Annals OR 183(1): 25-46 (2011) | |
| 32 | Ahmed Riadh Rebai, Saïd Hanafi: An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs CoRR abs/1102.5189: (2011) | |
| 31 | Ahmed Riadh Rebai, Saïd Hanafi: A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs CoRR abs/1103.3340: (2011) | |
| 30 | 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. European Journal of Operational Research 214(3): 536-545 (2011) | |
| 2010 | ||
| 29 | Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits: New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem. Hybrid Metaheuristics 2010: 118-132 | |
| 28 | 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: 302-313 | |
| 27 | Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev: A tabu search with an oscillation strategy for the discriminant analysis problem. Computers & OR 37(10): 1688-1696 (2010) | |
| 26 | Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic: Variable neighbourhood decomposition search for 0-1 mixed integer programs. Computers & OR 37(6): 1055-1067 (2010) | |
| 25 | Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon: A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. Discrete Applied Mathematics 158(2): 97-109 (2010) | |
| 24 | Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic: Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. Electronic Notes in Discrete Mathematics 36: 759-766 (2010) | |
| 23 | Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub: An Iterated Local Search for Solving A Location-Routing Problem. Electronic Notes in Discrete Mathematics 36: 875-882 (2010) | |
| 22 | Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits: Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electronic Notes in Discrete Mathematics 36: 883-890 (2010) | |
| 21 | Fred Glover, Saïd Hanafi: Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity. Int. J. of Applied Metaheuristic Computing 1(1): 1-15 (2010) | |
| 20 | Fred Glover, Saïd Hanafi: Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance. Int. J. of Applied Metaheuristic Computing 1(2): 1-17 (2010) | |
| 19 | 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): 247-255 (2010) | |
| 2009 | ||
| 18 | Saïd Hanafi, Raïd Mansi, Christophe Wilbaut: Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. Hybrid Metaheuristics 2009: 73-83 | |
| 17 | Ahmed Riadh Rebai, Hussein M. Alnuweiri, Saïd Hanafi: A novel prevent-scan Handoff technique for IEEE 802.11 WLANs. ICUMT 2009: 1-5 | |
| 16 | Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon: Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search CoRR abs/0905.0848: (2009) | |
| 15 | Christophe Wilbaut, Saïd Hanafi: New convergent heuristics for 0-1 mixed integer programming. European Journal of Operational Research 195(1): 62-74 (2009) | |
| 14 | Christophe Wilbaut, Saïd Salhi, Saïd Hanafi: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. European Journal of Operational Research 199(2): 339-348 (2009) | |
| 13 | Luce Brotcorne, Saïd Hanafi, Raïd Mansi: A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3): 215-218 (2009) | |
| 12 | Luce Brotcorne, Clarisse Dhaenens, Saïd Hanafi, El-Ghazali Talbi: Articles ROADEF 2006. RAIRO - Operations Research 43(3): 253 (2009) | |
| 2008 | ||
| 11 | Ahmed Riadh Rebai, Mariem Fliss, Slah Jarboui, Saïd Hanafi: A New Link Adaptation Scheme for IEEE 802.11 WLANs. NTMS 2008: 1-5 | |
| 10 | Saïd Hanafi, Christophe Wilbaut: Scatter Search for the 0-1 Multidimensional Knapsack Problem. J. Math. Model. Algorithms 7(2): 143-159 (2008) | |
| 2007 | ||
| 9 | Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim: Mathematical programming approach to the Petri nets reachability problem. European Journal of Operational Research 177(1): 176-197 (2007) | |
| 8 | Saïd Hanafi, Fred Glover: Exploiting nested inequalities and surrogate constraints. European Journal of Operational Research 179(1): 50-63 (2007) | |
| 2005 | ||
| 7 | Arnaud Fréville, Saïd Hanafi: The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects. Annals OR 139(1): 195-227 (2005) | |
| 2004 | ||
| 6 | Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim: Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. CPAIOR 2004: 112-126 | |
| 5 | Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi: Efficient reachability analysis of bounded Petri nets using constraint programming. SMC (2) 2004: 1870-1875 | |
| 2002 | ||
| 4 | Fred Glover, Saïd Hanafi: Tabu search and finite convergence. Discrete Applied Mathematics 119(1-2): 3-36 (2002) | |
| 3 | Saïd Hanafi, Fred Glover: Resolution Search and Dynamic Branch-and-Bound. J. Comb. Optim. 6(4): 401-423 (2002) | |
| 2001 | ||
| 2 | Saïd Hanafi: On the Convergence of Tabu Search. J. Heuristics 7(1): 47-58 (2001) | |
| 1 | Saïd Hanafi, Arnaud Fréville: Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List. RAIRO - Operations Research 35(2): 251-267 (2001) | |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page