R. Ahuja, O. Ergun, J. Orlin, and A. Punnen, "A survey of very large-scale neighborhood search techniques," Discrete Appl. Math., vol. 123, no. 1-3, pp. 75-102, 2002.
P. Hansen and N. Mladenovic, "Variable neighborhood search: principles and applications," European Journal of Operational Research, vol. 130, no. 3, pp. 449-467, 2001.
T. Lust and J. Teghem, "Two-phase Pareto local search for the biobjective traveling salesman problem," Journal of Heuristics, vol. 16, no. 3, pp. 475-510, 2010.
L. Paquete, M. Chiarandini, and T. Stützle, "Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study," in Metaheuristics for Multiobjective Optimisation, X. Gandibleux, M. Sevaux, K. Sörensen, and V. T'kindt, Eds. Berlin: Springer. Lecture Notes in Economics and Mathematical Systems Vol. 535, 2004, pp. 177-199.
T. Lust and J. Teghem, "The multiobjective multidimensional knapsack problem: a survey and a new approach," International Transactions in Operational Research, vol. 19, no. 4, pp. 495-520.
T. Lust and J. Teghem, "The multiobjective traveling salesman problem: a survey and a new approach," in Advances in Multi-Objective Nature Inspired Computing, ser. Studies in Computational Intelligence, C. C. Coello, C. Dhaenens, and L. Jourdan, Eds. Springer Berlin/Heidelberg, 2010, vol. 272, pp. 119-141.
A. Jaszkiewicz, "Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the setcovering problem," IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 133-143, April 2003.
C. Prins, C. Prodhon, and R. W. Calvo, "Two-phase method and lagrangian relaxation to solve the bi-objective set covering problem," Annals OR, vol. 147, no. 1, pp. 23-41, 2006.
Y. Aneja and K. Nair, "Bicriteria transportation problem," Management Science, vol. 25, pp. 73-78, 1979.
G. Lan, G. De Puy, and G. Whitehouse, "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, vol. 176, no. 3, pp. 1387-1403, 2007.
E. Zitzler, "Evolutionary algorithms for multiobjective optimization: methods and applications," Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999.
P. Czyzak and A. Jaszkiewicz, "Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization," Journal of Multi-Criteria Decision Analysis, vol. 7, pp. 34-47, 1998.
M. Laumanns, L. Thiele, and E. Zitzler, "An adaptative scheme to generate the Pareto front based on the epsilonconstraint method," Technischer Bericht, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Tech. Rep. 199, 2004.
M. Hansen and A. Jaszkiewicz, "Evaluating the quality of approximations of the nondominated set," Technical University of Denmark, Lingby, Denmark, Tech. Rep., 1998.
