Author:
Altner Douglas S.,Ahuja Ravindra K.,Ergun Özlem,Orlin James B.
Reference43 articles.
1. Abdullah S, Ahmadi S, Burke EK, Dror M, McCollum B (2007) A tabu-based large neighborhood search methodology for the capacitated examination timetabling problem. J Oper Res Soc 58:1494–1502
2. Agarwal R, Ahuja RK, Laporte G, Shen ZJ (2003) A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Leung, JY-T (ed) Handbook of scheduling: algorithms, models and performance analysis. CRC, Boca Raton, pp 49-01–49-23
3. Ahuja RK, Orlin JB, Sharma D (2001) Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math Program 91:71–97
4. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123:75–102
5. Ahuja RK, Orlin JB, Sharma D (2003) A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Oper Res Lett 31:185–194
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献