1. Breakout local search for maximum clique problems;Benlic;Comput Oper Res,2013
2. Breakout local search for the quadratic assignment problem;Benlic;Appl Math Comput,2013
3. Benlic U, Hao JK. Breakout local search for the vertex separator problem. In: IJCAI 2013, Proceedings of the 23rd international joint conference on artificial intelligence; 2013. p. 461–7.
4. One-processor scheduling with symmetric earliness and tardiness penalties;Garey;Math Oper Res,1998
5. Tabu search—Part I;Glover;ORSA J Comput,1989