
Search the dblp DataBase
Saïd Hanafi:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. [Citation Graph (0, 0)][DBLP] CPAIOR, 2004, pp:112126 [Conf]
 Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi
Efficient reachability analysis of bounded Petri nets using constraint programming. [Citation Graph (0, 0)][DBLP] SMC (2), 2004, pp:18701875 [Conf]
 Fred Glover, Saïd Hanafi
Tabu search and finite convergence. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:12, pp:336 [Journal]
 Saïd Hanafi
On the Convergence of Tabu Search. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2001, v:7, n:1, pp:4758 [Journal]
 Saïd Hanafi, Fred Glover
Resolution Search and Dynamic BranchandBound. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2002, v:6, n:4, pp:401423 [Journal]
 Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim
Mathematical programming approach to the Petri nets reachability problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:177, n:1, pp:176197 [Journal]
 Saïd Hanafi, Fred Glover
Exploiting nested inequalities and surrogate constraints. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:1, pp:5063 [Journal]
Iterative RelaxationBased Heuristics for the Multiplechoice Multidimensional Knapsack Problem. [Citation Graph (, )][DBLP]
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. [Citation Graph (, )][DBLP]
A New Link Adaptation Scheme for IEEE 802.11 WLANs. [Citation Graph (, )][DBLP]
A novel preventscan Handoff technique for IEEE 802.11 WLANs. [Citation Graph (, )][DBLP]
Variable neighbourhood decomposition search for 01 mixed integer programs. [Citation Graph (, )][DBLP]
A tabu search with an oscillation strategy for the discriminant analysis problem. [Citation Graph (, )][DBLP]
Solving the 01 Multidimensional Knapsack Problem with Resolution Search [Citation Graph (, )][DBLP]
A multilevel search strategy for the 01 Multidimensional Knapsack Problem. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
