Author:
Quiroz Marcela,Cruz-Reyes Laura,Torres-Jimenez Jose,Santillán Claudia Gómez,Huacuja Héctor J. Fraire,Melin Patricia
Publisher
Springer International Publishing
Reference65 articles.
1. Wolpert, D., Macready, W.: No free lunch theorems for optimizations. IEEE Trans. Evol. Comput. 1, 67–82 (1997)
2. Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875–889 (2012)
3. Smyth, K.: Understanding stochastic local search algorithms: an empirical analysis of the relationship between search space structure and algorithm behaviour. The University of British Columbia, Ms. thesis (2004)
4. Garey, M., Jonson, D.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, a classic introduction to the field (1979)
5. Smith-Miles, K., James, R., Giffin, J., Tu, Y.: Understanding the relationship between scheduling problem structure and heuristic performance using knowledge discovery. In: Learning and Intelligent Optimization, LION 3 (2009)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献