1. Aarts E, Lenstra JK (1997) Local search in combinatorial optimization. Wiley, New York
2. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New York
3. Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123:75–102
4. Angel E, Bampis E, Pascual F, Warnier J (2006) Restricted matchings and efficient exploration of an exponential neighborhood for the vehicle routing problem. Technical Report IBISC RR 2006-01, IBISC, Université d’Evry Val d’Essonne, France
5. Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14(1):52–67