( en | de | ru )

 

Disambiguation of "Hanafi, Saïd"

Author of the publication

copydeleteadd this publication to your clipboard
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem.

, , , and . Comput. Oper. Res., 39 (1): 32-41 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ayda Saïdane

Saïd Harchi

Saïd Izza

Hamid Hanafi

Saïd Aouada

 

Other publications of authors with the same name

Efficient reachability analysis of bounded Petri nets using constraint programming., , and . SMC (2), page 1870-1875. IEEE, (2004)A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case., , and . CoDIT, page 219-224. IEEE, (2014)A novel prevent-scan Handoff technique for IEEE 802.11 WLANs., , and . ICUMT, page 1-5. IEEE, (2009)A two-stage flow shop scheduling problem with transportation considerations., , , , and . 4OR, 13 (4): 381-402 (2015)A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem., , , and . Eur. J. Oper. Res., 220 (1): 270-285 (2012)An enhanced heuristic technique for AP selection in 802.11 handoff procedure., , , and . ICT, page 576-580. IEEE, (2010)A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs, and . CoRR, (2011)Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming., , and . CPAIOR, volume 3011 of Lecture Notes in Computer Science, page 112-126. Springer, (2004)A generic pixel distribution architecture for parallel video processing., , , and . ReConFig, page 1-8. IEEE, (2014)Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem., , , and . Comput. Oper. Res., 39 (1): 32-41 (2012)