1. Local Search in Combinatorial Optimization;Aarts,1997
2. R.K. Ahuja, J.B. Orlin, D. Sharma, New neighborhood search structures for the capacitated minimum spanning tree problem, Research Report 99-2, Department of Industrial & Systems Engineering, University of Florida, 1999.
3. Bottleneck assignment problem under categorization;Aggarwal;Comput. Oper. Res.,1986
4. On the solution of traveling salesman problems;Applegate;Documenta Math. ICM,1998
5. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989