1. D.P. Ackley, An empirical study of bit vector function optimization, in Genetic Algorithms and Simulated Annealing, ed. by L. Davis (Morgan Kaufmann, Los Altos, 1987), pp. 170–204
2. S. Baluja, An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical report CMU-CS-95-193, Computer Science Department, Carnegie Mellon University (1995)
3. R.P. Beausoleil, G. Baldoquin, R.A. Montejo, Multi-start and path relinking methods to deal with multiobjective knapsack problems. Ann. Oper. Res. 157(1), 105–133 (2008)
4. S. Binato, H. Faria Jr., M.G.C. Resende, Greedy randomized adaptive path relinking, in Proceedings of the 4th Metaheuristics International Conference (2001), pp. 393–397
5. K.D. Boese, A.B. Kahng, S. Muddu, A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16(2), 101–113 (1994)