Author:
Sakuraba Celso S.,Ronconi Débora P.,Birgin Ernesto G.,Yagiura Mutsunori
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference27 articles.
1. Local optima avoidance in depot location;Baxter;Journal of the Operational Research Society,1981
2. Becker, O. (1967). Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsverfahren, In: Computer uses in the Social Science, Berichteiner Working Conference, Wien.
3. Metaheuristics in combinatorial optimization: Overview and conceptual comparison;Blum;ACM Computing Surveys,2003
4. An experimental evaluation of a scatter search for the linear ordering problem;Campos;Journal of Global Optimization,2001
5. Ceberio, J., Hernando, L., Mendiburu, A., Lozano, J. (2013), Understanding instance complexity in the linear ordering problem. In: H. Yin, K. Tang, Y. Gao (eds.), Proceedings of the 14th International Conference on Intelligent Data Engineering and Automated Learning – IDEAL 2013, Lecture Notes in Computer Science 8206, pp. 479–486.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献