1. Aguirre, H.E., Tanaka, K.: Random bit climbers on multiobjective MNK-landscapes: effects of memory and population climbing. IEICE Trans. Electron. 88-A(1), 334–345 (2005)
2. Alsheddy, A., Tsang, E.: Guided Pareto local search and its application to the 0/1 multi-objective Knapsack problem. In: Metaheur. Inter. Conf. (MIC) (2009)
3. Angel, E., Bampis, E., Gourvès, L.: A dynasearch neighbourhood for the bicriteria traveling salesman problem. In: LNEMS, vol. 535, 153–176 (2004)
4. Bader, J.: Hypervolume-Based search for multiobjective optimization: theory and methods. Ph.D. thesis, ETH, Zurich, Switzerland (2010)
5. Bader, J., Zitzler, E.: Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45–76 (2011)