Author:
Raidl Günther R.,Puchinger Jakob,Blum Christian
Publisher
Springer International Publishing
Reference125 articles.
1. C. Aggarwal, J. Orlin, R. Tai, Optimized crossover for the independent set problem. Oper. Res. 45(2), 226–234 (1997)
2. R. Ahuja, J. Orlin, A. Tiwari, A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27(10), 917–934 (2000)
3. R.K. Ahuja, J. Orlin, D. Sharma, Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Program. 91(1), 71–97 (2001)
4. R.K. Ahuja, Ö Ergun, J.B. Orlin, A.P. Punnen, A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1-3), 75–102 (2002)
5. S. Al-Shihabi, Ants for sampling in the nested partition algorithm, in Proceedings of HM 2004 – First International Workshop on Hybrid Metaheuristics, ed. by C. Blum, A. Roli, M. Sampels, Valencia, Spain (2004), pp. 11–18
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献