( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving Manufacturing Cell Design Problems by Using a Bat Algorithm Approach.

, , , , , , , и . ICSI (1), том 9712 из Lecture Notes in Computer Science, стр. 184-191. Springer, (2016)

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.

Roberto Araya Araya

Eduardo Araya

Patcharin Arayapong

Mauricio Araya-López

Yimen G Araya-Ajoy

 

Другие публикации лиц с тем же именем

Stochastic Local Search for the Direct Aperture Optimisation Problem., , и . Expert Syst. Appl., (2021)Node selection strategies in interval Branch and Bound algorithms., , и . J. Glob. Optim., 64 (2): 289-304 (2016)A fill-and-reduce greedy algorithm for the container pre-marshalling problem., и . Oper. Res., 23 (3): 51 (сентября 2023)Incremental Move for 2D Strip-Packing., , и . ICTAI (2), стр. 489-496. IEEE Computer Society, (2007)0-7695-3015-X.A Contractor Based on Convex Interval Taylor., , и . CPAIOR, том 7298 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2012)Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity., , и . CP, том 6308 из Lecture Notes in Computer Science, стр. 61-68. Springer, (2010)Estimating Upper Bounds for Improving the Filtering in Interval Branch and Bound Optimizers.. ICTAI, стр. 24-30. IEEE Computer Society, (2014)Towards a population-based framework for improving stochastic local search algorithms., , и . GECCO, стр. 337-344. ACM, (2012)A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes., , , и . Int. J. Artif. Intell. Tools, 17 (5): 881-901 (2008)Nonlinear biobjective optimization: improvements to interval branch & bound algorithms., , и . J. Glob. Optim., 75 (1): 91-110 (2019)