PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hanafi, Saïd"

Author of the publication

copydeleteadd this publication to your clipboard
Variable neighborhood search: basics and variants.

, , , and . EURO J. Computational Optimization, 5 (3): 423-454 (2017)

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.

No persons found for author name Hanafi, Saïd
add a person with the name Hanafi, Saïd
 

Other publications of authors with the same name

An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance., , and . CoDIT, page 594-599. IEEE, (2016)Variable neighborhood search for the travelling deliveryman problem., , and . 4OR, 11 (1): 57-73 (2013)Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search, , , , and . CoRR, (2009)Probabilistic Tabu Search for the Cross-Docking Assignment Problem., , , , and . European Journal of Operational Research, 277 (3): 875-885 (2019)Tabu search and finite convergence., and . Discrete Applied Mathematics, 119 (1-2): 3-36 (2002)Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance., and . Int. J. of Applied Metaheuristic Computing, 1 (2): 1-17 (2010)Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity., and . Int. J. of Applied Metaheuristic Computing, 1 (1): 1-15 (2010)A parallel subgradient algorithm for Lagrangean dual function of the p-median problem., , , and . Stud. Inform. Univ., 9 (3): 105-124 (2011)Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions., , , and . ICVNS, volume 11328 of Lecture Notes in Computer Science, page 202-215. Springer, (2018)New complexity results on scheduling problem in a robotic cell., , , and . RAIRO - Operations Research, 51 (3): 749-762 (2017)