| * | 2009 |
|---|
| 13 | EE | Saïd Hanafi,
Raïd Mansi,
Christophe Wilbaut:
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem.
Hybrid Metaheuristics 2009: 73-83 |
| 12 | EE | 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) |
| 11 | EE | Christophe Wilbaut,
Saïd Hanafi:
New convergent heuristics for 0-1 mixed integer programming.
European Journal of Operational Research 195(1): 62-74 (2009) |
| 10 | EE | 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) |
| 9 | EE | 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) |
| 2007 |
|---|
| 8 | EE | 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) |
| 7 | EE | Saïd Hanafi,
Fred Glover:
Exploiting nested inequalities and surrogate constraints.
European Journal of Operational Research 179(1): 50-63 (2007) |
| 2005 |
|---|
| 6 | EE | Arnaud Fréville,
Saïd Hanafi:
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects.
Annals OR 139(1): 195-227 (2005) |
| 2004 |
|---|
| 5 | EE | 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 |
| 4 | EE | Thomas Bourdeaud'huy,
Pascal Yim,
Saïd Hanafi:
Efficient reachability analysis of bounded Petri nets using constraint programming.
SMC (2) 2004: 1870-1875 |
| 2002 |
|---|
| 3 | | Fred Glover,
Saïd Hanafi:
Tabu search and finite convergence.
Discrete Applied Mathematics 119(1-2): 3-36 (2002) |
| 2 | | Saïd Hanafi,
Fred Glover:
Resolution Search and Dynamic Branch-and-Bound.
J. Comb. Optim. 6(4): 401-423 (2002) |
| 2001 |
|---|
| 1 | | Saïd Hanafi:
On the Convergence of Tabu Search.
J. Heuristics 7(1): 47-58 (2001) |
