1. Local Search in Combinatorial Optimization,1997
2. R. Agarwal, Ö. Ergun, J.B. Orlin, C.N. Potts, Parallel machine scheduling problems with variable depth local search, Working paper, School of Ind. and Sys. Engr., Georgia Institute of Technology, Atlanta, 2003
3. A survey of very large-scale neighborhood search techniques;Ahuja;Discrete Applied Mathematics,2002
4. E. Balas, New classes of efficiently solvable generalized salesman problems, MSRR No. 615, GSIA, Carnegie Mellon University, Pittsburgh, 1996
5. Linear time dynamic programming algorithms for new classes of Restricted TSPs;Balas;INFORMS Journal on Computing,2001