Ahuja, R.K., Ergun, Ö., Orlin, J.B., Punnen, A.P., 2002. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 1-3, 75-102.
Alsheddy, A., Tsang, E.P.K., 2009. Guided Pareto local search and its application to the 0/1 multi-objective knapsack problems. In Proceedings of the Eighth Metaheuristic International Conference (MIC'09), Hamburg, Germany, July 13-16, 2009, pp. 1-14.
Alsheddy, A., Tsang, E.P.K., 2010. Guided Pareto local search based frameworks for pareto optimization. In Proceedings of the WCCCI IEEE World Congress on Computational Intelligence, Barcelona, July 18-23, 2010, pp. 1-8.
Alves, M.J., Almeida, M., 2007. MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Computers & Operations Research 34, 3458-3470.
Angel, E., Bampis, E., Gourvès, L., 2004. A dynasearch neighborhood for the bicriteria traveling salesman problem. In Gandibleux, X., Sevaux, M., Sörensen, K., T'kindt, V. (eds) Metaheuristics for Multiobjective Optimisation, Vol. 535 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, pp. 153-176.
Balas, E., Zemel, E., 1980. An algorithm for large zero-one knapsack problems. Operational Research 28, 1130-1154.
Barichard, V., Hao, J.K., 2002. An empirical study of tabu search for the MOKP. In Proceedings of the First International Workshop on Heuristics, Vol. 4, Beijing, July 22-27, 2002, Series of Information & Management Sciences, pp. 47-56.
Barichard, V., Hao, J-K., 2003. Genetic tabu search for the multi-objective knapsack problem. Journal of Tsinghua Science and Technology 8, 1, 8-13.
Bazgan, C., Hugot, H., Vanderpooten, D., 2009a. Solving efficiently the 0-1 multi-objective knapsack problem. Computers & Operations Research 36, 1, 260-279.
Bazgan, C., Hugot, H., Vanderpooten, D., 2009b. Implementing an efficient FPTAS for the 0-1 multi-objective knapsack problem. European Journal of Operational Research 198, 1, 47-56.
Beausoleil, R.P., Baldoquin, G., Montejo, R.A., 2008. Multi-start and path relinking methods to deal with multiobjective knapsack problems. Annals of Operations Research 157, 105-133.
Ben Abdelaziz, F., Krichen, S., 1997. A tabu search heuristic for multiobjective knapsack problems. Technical Report RRR 28-97, Rutgers Center for Operations Research, Piscataway, NJ.
Ben Abdelaziz, F., Chaouachi, J., Krichen, S., 1999. A hybrid heuristic for multiobjective knapsack problems. In Voss, S., Martello, S., Osman, I., Roucairol, C. (eds) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, pp. 205-212.
Captivo, M.E., Clímaco, J.C.N., Figueira, J.R., Martins, E.Q.V., Santos, J.L., 2003. Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Computers & Operations Research 30, 12, 1865-1886.
Czyzak, P., Jaszkiewicz, A., 1998. Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7, 34-47.
Deb, K., Goel, T., 2001. Controlled elitist non-dominated sorting genetic algorithms for better convergence. In Zitzler, E., Deb, K., Thiele, L., Coello, C.A., Corne, D. (eds), Proceedings of First International Conference, EMO2001, Zurich, Switzerland, March 7-9, 2001, Vol. 1993 of Lecture Notes in Computer Science. Springer, Berlin, pp. 67-81.
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2, 182-197.
Delort, C., Spanjaard, O., 2010. Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem. In Proceedings of 9th International Symposium on Experimental Algorithms (SEA 2010), Napoli, Italy, May 20-22, 2010, Vol. 6049 of Lecture Notes in Computer Science, pp. 253-265.
Ehrgott, M., Gandibleux, X., 2002. Multiobjective combinatorial optimization. In Ehrgott, M., Gandibleux, X. (eds) Multiple Criteria Optimization - State of the Art Annotated Bibliographic Surveys, Vol. 52. Kluwer Academic, Boston, MA, pp. 369-444.
Ehrgott, M., Gandibleux, X., 2007. Bound sets for biobjective combinatorial optimization problems. Computers & Operations Research 34, 2674-2694.
Figuera, J.R., Wiecek, M., Tavares, G., 2006. Multiple criteria knapsack problems: network models and computational results. In Proceedings of the Multi-Objective Programming and Goal Programming Conference (MOPGP'06), Tours, France, June 12-14, 2006.
Florios, K., Mavrotas, G., Diakoulaki, D., 2010. Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms. European Journal of Operational Research 203, 1, 14-21.
Gandibleux, X., Fréville, A., 2000. Tabu search based procedure for solving the 0-1 multi-objective knapsack problem: the two objectives case. Journal of Heuristics 6, 3, 361-383.
Gandibleux, X., Klamroth, K., 2006. Cardinality bounds for multiobjective knapsack problems based on weighted sums scalarizations. In Proceedings of the Multi-Objective Programming and Goal Programming Conference (MOPGP'06), Tours, France, June 12-14, 2006.
Gandibleux, X., Morita, H., Katoh, N., 2001. The supported solutions used as a genetic information in a population heuristics. In Zitzler, E., Deb, K., Thiele, L., Coello, C.A., Corne, D. (eds), Proceedings of First International Conference, EMO2001, Zurich, Switzerland, March 7-9, 2001, Vol. 1993 of Lecture Notes in Computer Science. Springer, Berlin, pp. 429-442.
Glover, F., 1965. A multiphase dual algorithm for the zero-one integer programming problem. Operations Research 13, 6, 879-919.
Glover, F., 1994. Optimization by ghost image processes in neural networks. Computers & Operations Research 21, 8, 801-822.
Glover, F., 2000. Multi-start and strategic oscillation methods-principles to exploit adaptive memory. In Laguna, M., Gonzalez-Velarde, J.L. (eds) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic, Dordrecht, pp. 1-24.
Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic, Dordrecht.
Gomes da Silva, C., Clímaco, J., Figueira, J.R., 2004. Scatter search method for the bi-criteria multi-dimensional {0, 1}-knapsack problem using surrogate relaxation. Journal of Mathematical Modelling and Algorithms 3, 3, 183-208.
Gomes da Silva, C., Clímaco, J., Figueira, J.R., 2006. A scatter search method for bi-criteria {0-1}-knapsack problems. European Journal of Operational Research 169, 373-391.
Gomes da Silva, C., Clímaco, J., Figueira, J.R., 2008. Core problems in bi-criteria {0, 1}-knapsack problems. Computers & Operations Research 35, 1, 2292-2306.
Gomes da Silva, C., Figueira, J.R., Clímaco, J., 2007. Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems. European Journal of Operational Research 177, 1656-1677.
Haimes, Y., Lasdon, L., Wismer, D., 1971. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transactions on Systems, Man, and Cybernetics 1, 296-297.
Hansen, P., 1979. Bicriterion path problems. Lecture Notes in Economics and Mathematical Systems 177, 109-127.
Ishibuchi, H., Murada, T., 1998. A multi-objective genetic local search algorithm and its application to flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews 28, 3, 392-403.
Jaszkiewicz, A., 1998. Genetic local search for multiple objective combinatorial optimization. Technical Report RA-014/98, Institute of Computing Science, Poznań University of Technology, Poznań, Poland.
Jaszkiewicz, A., 2000. Experiments done with the MOMHLIB:. Technical report, Institute of Computing Science, Poznań University of Technology, Poznań, Poland.
Jaszkiewicz, A., 2000. On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-a comparative experiment. Technical Report RA-002/2000, Institute of Computing Science, Poznań University of Technology, Poznań, Poland.
Jaszkiewicz, A., 2001a. A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Technical Report RA-003/01, Institute of Computing Science, Poznań University of Technology, Poznań, Poland.
Jaszkiewicz, A., 2001b. Comparison of local search-based metaheuristics on the multiple-objective knapsack problem. Foundations of Computing and Decision Sciences 26, 1, 99-120.
Jaszkiewicz, A., 2002. On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-a comparative experiment. IEEE Transactions on Evolutionary Computation 6, 4, 402-412.
Jaszkiewicz, A., 2004. On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study. European Journal of Operational Research 158, 2, 418-433.
Jorge, J., Gandibleux, X. 2007. Nouvelles propositions pour la résolution exacte du problème de sac à dos bi-objectif unidimensionnel en variables binaires, février. FRANCORO V - MOSIM'07.
Klamroth, K., Wiecek, M., 2000. Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics 47, 1, 57-76.
Knowles, J., Corne, D., 1999. The Pareto archived evolution strategy: a new baseline algorithm for multiobjective optimisation. In Proceedings of 1999 Congress on Evolutionary Computation, July 6-9, 1999. IEEE Service Center, Washington, DC, pp. 98-105.
Knowles, J., Corne, D., 2000a. M-PAES: A memetic algorithm for multiobjective optimization. In Proceedings of 2000 Congress on Evolutionary Computation, La Jolle, CA, July 6-9, 2000, Vol. 1. IEEE Service Center, Piscataway, NJ, pp. 325-332.
Knowles, J., Corne, D., 2000b. A comparison of diverse approaches to memetic multiobjective combinatorial optimization. In Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, Las Vegas, NV, July 8-12, 2000, pp. 103-108.
Kumar, R., Banerjee, N., 2006. Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem. Theoretical Computer Science 358, 1, 104-120.
Larranaga, P., Lozano, J.A., 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Genetic Algorithms and Evolutionary Computation). Kluwer Academic, Boston, MA.
Laumanns, M., Thiele, L., Zitzler, E., 2006. An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. European Journal of Operational Research 169, 3, 932-942.
Li, H., Zhang, Q., Tsang, E., Ford, J.A., 2004. Hybrid estimation of distribution algorithm for multiobjective knapsack problem. In Proceedings of the Fourth European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbre, Portugal, April 5-7, 2004, pp. 145-154.
Lin, S., Kernighan, B.W., 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498-516.
Lust, T., 2009. New metaheuristics for solving MOCO problems: application to the knapsack problem, the traveling salesman problem and IMRT optimization. PhD thesis, University of Mons, Mons, Belgium.
Lust, T., Teghem, J., 2008. MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. RAIRO: Operations Research 42, 1, 3-33.
Lust, T., Teghem, J., 2010. Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics 16, 3, 475-510.
Martello, S., Toth, P., 1990. Knapsack Problems. Wiley, New York.
Martins, E.Q.V., Dos Santos, J.L.E., 1999. The labeling algorithm for the multiobjective shortest path problem. Technical Report 99/005 CISUC, Departamento de Matemática, Universidade de Coimbra.
Mavrotas, G., Figueira, J.R., Florios, K., 2009. Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core. Applied Mathematics and Computation 215, 7, 2502-2514.
Michalewicz, Z., Arabas, J., 1994. Genetic algorithms for the 0/1 knapsack problem. In Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems Conference (ISMIS), Springer, Berlin, pp. 134-143.
Miettinen, K., 1999. Nonlinear Multiobjective Optimization. Kluwer Academic, Boston, MA.
Paquete, L., Chiarandini, M., Stützle, T., 2004. Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In Gandibleux, X., Sevaux, M., Sörensen, K., T'kindt, V. (eds) Metaheuristics for Multiobjective Optimisation, Vol. 535 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, pp. 177-199.
Pelikan, M., Sastry, K., Cantu-Paz, E., 2006. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence). Springer-Verlag New York, Inc., Secaucus, NJ.
Puchinger, J., Raidl, G.R., Pferschy, U., 2006. The core concept for the multidimensional knapsack problem. In Gottlieb, J., Raidl, G.R. (eds) EvoCOP, Vol. 3906 of Lecture Notes in Computer Science. Springer, Berlin, pp. 195-208.
Sato, H., Aguirre, H.E., Tanaka, K., 2007. Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems. European Journal of Operational Research 181, 3, 1708-1723.
Serafini, P., 1992. Simulated annealing for multi-objective optimization problems. In Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Vol. 1, Taipei, July 19-24, 1992 pp. 87-92.
Steuer, R., 1986. Multiple Criteria Optimization: Theory, Computation and Applications. John Wiley & Sons, New York.
Talbi, E-G., 2009. Metaheuristics: From Design to Implementation. Wiley-Blackwell, Hoboken, NJ.
Teghem, J., 2009. Multiple objective linear programming. In Bouyssou, D., Dubois, D., Prade, H., Pirlot, M. (eds) Decision-making Process (Concepts and Methods), Wiley-ISTE, Hoboken, NJ, pp. 199-264.
Teghem, J., Kunsch, P., 1986. A survey of techniques for finding efficient solutions to multi-objective integer linear programming. Asia-Pacific Journal of Operational Research 3, 2, 95-108.
Tuyttens, D., 2006. Private communication.
Ulungu, E.L., 1993. Optimisation Combinatoire multicritère: Détermination de l'ensemble des solutions efficaces et méthodes interactives. PhD thesis, Université de Mons-Hainaut, Faculté des Sciences, Mons, Belgium.
Ulungu, E.L., Teghem, J., 1994. Multiobjective combinatorial optimization problems: a survey. Journal of Multi-Criteria Decision Analysis 3, 83-104.
Ulungu, E.L., Teghem, J., 1995. The two-phases method: an efficient procedure to solve biobjective combinatorial optimization problems. Foundation of Computing and Decision Science 20, 149-156.
Ulungu, E.L., Teghem, J., 1997. Solving multiobjective knapsack problems by a branch-and-bound procedure. In Climaco, J.N. (ed.) Multicriteria Analysis. Springer, Berlin, pp. 269-278.
Ulungu, E.L., Teghem, J., Fortemps, Ph., Tuyttens, D., 1999. MOSA method: A tool for solving multiobjective combinatorial optimization problems. Journal of Multi-Criteria Decision Analysis 8, 4, 221-236.
Vianna, D.S., Arroyo, J.E.C., 2004. A GRASP algorithm for the multi-objective knapsack problem. In XXIV International Conference of the Chilean Computer Science Society (SCC'04), IEEE Computer Society, Arica, Chile, November 2004, pp. 69-75.
Visée, M., Teghem, J., Pirlot, M., Ulungu, E.L., 1998. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization 12, 139-155.
Voudouris, C., Tsang, E.P.K., 1999. Guided local search and its application to the travelling salesman problem. European Journal of Operational Research 113, 2, 469-499.
Zhang, C.W., Ong, H.L., 2004. Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic. European Journal of Operational Research 159, 3, 545-557.
Zitzler, E., 1999. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland.
Zitzler, E., Thiele, L., 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3, 4, 257-271.
Zitzler, E., Laumanns, M., Thiele, L., 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland.
Zitzler, E., Laumanns, M., Thiele, L., Fonseca, C.M., Grunert da Fonseca, V., 2002. Why quality assessment of multiobjective optimizers is difficult. In Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2002), Morgan Kaufmann, San Francisco, CA, pp. 666-673.
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V., 2003. Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation 7, 2, 117-132.
