Author:
Raidl Günther R.,Puchinger Jakob,Blum Christian
Reference105 articles.
1. Aggarwal, C., Orlin, J., Tai, R.: Optimized crossover for the independent set problem. Oper. Res. 45, 226–234 (1997)
2. Ahuja, R.K., Ergun, Ö., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1–3), 75–102 (2002)
3. Ahuja, R.K., Orlin, J., Sharma, D.: Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Programming 91(1), 71–97 (2001)
4. Ahuja, R., Orlin, J., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27, 917–934 (2000)
5. Al-Shihabi, S.: Ants for sampling in the nested partition algorithm. In: Blum et al. [22], pp. 11–18.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献