1. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory Comput. Syst. 45(3), 555–576 (2009)
2. Azim, G.A., Ben Othman, M.: Hybrid iterated local search algorithm for solving multiple sequences alignment problem. Far East J. Exp. Theor. Intell. 5(1–2), 1–17 (2010)
3. Balas, E.: A class of location, distribution and scheduling problems: modeling and solution methods. Proceedings of the Chinese-US Symposium on Systems Analysis, pp. 323–346. Wiley, New York (1983)
4. Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job shop scheduling. Manag. Sci. 44(2), 262–275 (1998)
5. Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for max-sat. J. Exp. Algorithmics (JEA) 2(2), 1–31 (1997)